137 search results - page 22 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
PAMI
2008
13 years 7 months ago
2008
This paper proposes a method for detecting object classes that exhibit variable shape structure in heavily cluttered images. The term "variable shape structure" is used t...
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
NIPS
1996
13 years 8 months ago
1996
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...