1541 search results - page 8 / 309 » Analysis of Random Noise and Random Walk Algorithms |
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
BERTINORO
2005
Springer
14 years 1 months ago
2005
Springer
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this work, the tracking analysis of the Normalized Least Mean Fourth (NLMF) algorithm is investigated for a random walk channel under very weak assumptions. The novelty of this...
CN
2007
13 years 8 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...