73 search results - page 11 / 15 » Random Walk on Directed Dynamic Graphs |
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
WSDM
2009
ACM
14 years 4 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
SIGIR
2009
ACM
14 years 4 months ago
2009
ACM
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
ICDE
2006
IEEE
14 years 11 months ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...