Sciweavers

85 search results - page 1 / 17
» Non Uniform Random Walks
Sort
View
DRW
2003
97views Mathematics» more  DRW 2003»
13 years 6 months ago
Non Uniform Random Walks
Nisheeth K. Vishnoi
EWSN
2010
Springer
14 years 1 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
ICDCS
2007
IEEE
13 years 11 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
13 years 6 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
SIAMCO
2010
128views more  SIAMCO 2010»
12 years 11 months ago
A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks
Abstract. This paper studies a class of non-Markovian and nonhomogeneous stochastic processes on a finite state space. Relying on a recent paper by Bena
Michel Benaïm, Olivier Raimond