Sciweavers

118 search results - page 24 / 24
» Performance of random walks in one-hop replication networks
Sort
View
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 days ago
Speeding up algorithms on compressed web graphs
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...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ICWSM
2009
13 years 3 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
ICPP
2007
IEEE
13 years 11 months ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra