Sciweavers

1109 search results - page 63 / 222
» Crawling on web graphs
Sort
View
ITA
2006
163views Communications» more  ITA 2006»
15 years 4 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 4 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
ISW
2009
Springer
15 years 10 months ago
Automated Spyware Collection and Analysis
Various online studies on the prevalence of spyware attest overwhelming numbers (up to 80%) of infected home computers. However, the term spyware is ambiguous and can refer to anyt...
Andreas Stamminger, Christopher Kruegel, Giovanni ...
SIGIR
2005
ACM
15 years 9 months ago
Server selection methods in hybrid portal search
The TREC .GOV collection makes a valuable web testbed for distributed information retrieval methods because it is naturally partitioned and includes 725 web-oriented queries with ...
David Hawking, Paul Thomas
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 6 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...