52 search results - page 2 / 11 » Querying high-dimensional data in single-dimensional space |
VLDB
2000
ACM
13 years 8 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
COCOON
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
STOC
1998
ACM
13 years 9 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...
DAWAK
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
MICAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...