Sciweavers

1949 search results - page 152 / 390
» Random graphs on surfaces
Sort
View
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 8 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
CVPR
2005
IEEE
16 years 6 months ago
Multilabel Random Walker Image Segmentation Using Prior Models
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
Leo Grady
ICML
2007
IEEE
16 years 5 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
122
Voted
RSA
2008
80views more  RSA 2008»
15 years 4 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman