28 search results - page 1 / 6 » Discrete Random Walks on One-Sided |
52
Voted
DRW
2003
15 years 26 days ago
2003
110
click to vote
UAI
2003
15 years 25 days ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
SACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
WSC
2001
15 years 25 days 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...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...