1186 search results - page 4 / 238 » Improving Random Walk Performance |
WOWMOM
2009
ACM
14 years 4 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
FOCS
1999
IEEE
14 years 2 months 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
2006
IEEE
14 years 3 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
NAACL
2007
13 years 11 months ago
2007
