364 search results - page 9 / 73 » Computing Communities in Large Networks Using Random Walks |
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
68
Voted
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
92
Voted
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
GI
2009
Springer
15 years 2 months ago
2009
Springer
: We develop a method to create taxonomies in large social networks solely based on users group membership information. We illustrate our technique using an example of the Flickr p...