1957 search results - page 265 / 392 » Approximate algorithms for neural-Bayesian approaches |
161
click to vote
ALENEX
2009
15 years 3 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
193
click to vote
SIGECOM
2011
ACM
14 years 8 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
195
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
143
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
165
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
Shannon's Noisy-Channel model, which describes how a corrupted message might be reconstructed, has been the corner stone for much work in statistical language and speech proc...