860 search results - page 49 / 172 » Biased Random Walks |
BMCBI
2007
13 years 11 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
14 years 11 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...
SODA
2003
ACM
14 years 10 days ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
CISSE
2009
Springer
14 years 2 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 ...
RSA
2006
13 years 11 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...