364 search results - page 24 / 73 » Computing Communities in Large Networks Using Random Walks |
NSDI
2010
15 years 1 months ago
2010
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
INTR
2002
14 years 11 months ago
2002
There have been many attempts to study the content of the web, either through human or automatic agents. Five different previously used web survey methodologies are described and ...
SODA
2007
ACM
15 years 1 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
184
click to vote
PVLDB
2010
14 years 6 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...