Sciweavers

860 search results - page 77 / 172
» Biased Random Walks
Sort
View
97
Voted
FGR
2004
IEEE
169views Biometrics» more  FGR 2004»
15 years 4 months ago
Monocular Reconstruction of Human Motion by Qualitative Selection
One of the main difficulties when reconstructing human motion from monocular video is the depth ambiguity. Achieving a reconstruction, given the projection of the joints, can be r...
Martin Eriksson, Stefan Carlsson
RSA
2011
157views more  RSA 2011»
14 years 7 months ago
The cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
Colin Cooper, Alan M. Frieze
96
Voted
COLT
2008
Springer
15 years 2 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
CAV
2001
Springer
154views Hardware» more  CAV 2001»
15 years 4 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
133
Voted
COMBINATORICA
2010
14 years 10 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák