Sciweavers

1276 search results - page 208 / 256
» Vetting the links of the web
Sort
View
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 9 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
IMC
2006
ACM
14 years 3 months ago
Touring the internet in a TCP sidecar
An accurate router-level topology of the Internet would benefit many research areas, including network diagnosis, inter-domain traffic engineering, and overlay construction. We ...
Rob Sherwood, Neil Spring
AINA
2005
IEEE
14 years 3 months ago
iHITS: Extending HITS for Personal Interests Profiling
Ever since the boom of World Wide Web, profiling online users' interests has become an important task for content providers. The traditional approach involves manual entry of...
Ziming Zhuang
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 3 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
ICALP
2003
Springer
14 years 2 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren