1632 search results - page 28 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
PAMI
2006
15 years 3 months ago
2006
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
140
click to vote
JACM
2007
15 years 3 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
118
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
155
click to vote
ICMLC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
131
Voted
LION
2009
Springer
15 years 9 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...