338 search results - page 15 / 68 » Fast distributed random walks |
117
click to vote
RSA
2006
14 years 9 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
100
click to vote
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
RSA
2002
14 years 9 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
INFOCOM
2011
IEEE
14 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...
JSAC
2010
14 years 4 months ago
2010
Abstract--Wireless sensor networks (WSNs) deployed in hostile environments are vulnerable to clone attacks. In such attack, an adversary compromises a few nodes, replicates them, a...