300 search results - page 25 / 60 » Constrained Nearest Neighbor Queries |
NIPS
2004
13 years 9 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
STOC
1998
ACM
13 years 12 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ICDM
2002
IEEE
14 years 20 days 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...
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...