2996 search results - page 136 / 600 » Numberings and Randomness |
170
click to vote
WSC
2001
15 years 8 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
201
click to vote
STOC
2004
ACM
16 years 9 days ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
178
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
190
click to vote
INFOCOM
2005
IEEE
16 years 14 days ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
168
click to vote
SAGA
2007
Springer
16 years 1 months ago
2007
Springer
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...