860 search results - page 49 / 172 » Biased Random Walks |
94
Voted
BMCBI
2007
15 years 1 months ago
2007
Background: When analysing microarray and other small sample size biological datasets, care is needed to avoid various biases. We analyse a form of bias, stratification bias, that...
WSC
2001
15 years 2 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...
104
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
104
Voted
CISSE
2009
Springer
15 years 5 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
148
Voted
RSA
2006
15 years 1 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...