43 search results - page 4 / 9 » Twisting the Metric Space to Achieve Better Metric Trees |
FUIN
2006
13 years 6 months ago
2006
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
SAC
2006
ACM
14 years 6 days ago
2006
ACM
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
NIPS
2004
13 years 7 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
ICALP
1991
Springer
13 years 9 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...