338 search results - page 6 / 68 » Fast distributed random walks |
100
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
130
click to vote
IPTPS
2005
Springer
15 years 8 months ago
2005
Springer
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
134
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
ICDCSW
2009
IEEE
15 years 9 months ago
2009
IEEE
116
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...