733 search results - page 46 / 147 » Recommending random walks |
150
click to vote
WSC
2001
15 years 7 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...
167
click to vote
ICDCS
2007
IEEE
16 years 14 days ago
2007
IEEE
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...
187
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
157
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
202
click to vote
RSA
2006
15 years 6 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...