89 search results - page 17 / 18 » Efficient Search for Approximate Nearest Neighbor in High Di... |
TKDE
2008
13 years 5 months ago
2008
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
CVPR
2012
IEEE
11 years 8 months ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...