2403 search results - page 68 / 481 » Optimal Randomized RANSAC |
120
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
123
click to vote
STOC
1992
ACM
15 years 7 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...
152
click to vote
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
120
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
114
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...