767 search results - page 28 / 154 » On Clustering Using Random Walks |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
FOCS
1999
IEEE
14 years 29 days ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
INFOCOM
2010
IEEE
13 years 8 months ago
2010
IEEE
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
IPL
2000
13 years 8 months ago
2000
Abstract. The mutual exclusion protocol presented ensures that whatever perturbation the network undergo, it regains consistency in nite time: one and only one privilege token is p...
CCGRID
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...