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...
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
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...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...