151 search results - page 12 / 31 » Expected-case complexity of approximate nearest neighbor sea... |
155
click to vote
CVPR
2012
IEEE
13 years 2 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 ...
116
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
STOC
2002
ACM
16 years 1 days ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
120
click to vote
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...