1542 search results - page 132 / 309 » The metamathematics of random graphs |
112
click to vote
STOC
1992
ACM
15 years 6 months ago
1992
ACM
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...
108
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
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...
114
Voted
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
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...
128
click to vote
ICML
2008
IEEE
16 years 2 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
114
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...