733 search results - page 25 / 147 » Recommending random walks |
SIAMDM
2010
14 years 4 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
107
click to vote
SIGMETRICS
2012
ACM
13 years 2 days ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
67
Voted
ECCV
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We propose a novel restoration method for defects and missing regions in video sequences, particularly in application to archive film restoration. Our statistical framew...
68
Voted
IJBC
2007
14 years 9 months ago
2007
In 1873 Francis Galton had constructed a simple mechanical device where a ball is dropped vertically through a harrow of pins that deflect the ball sideways as it falls. Galton c...