151 search results - page 21 / 31 » Expected-case complexity of approximate nearest neighbor sea... |
NIPS
2007
13 years 9 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
IJCV
2010
13 years 6 months ago
2010
This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This lea...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...