Sciweavers

92 search results - page 2 / 19
» Quality and efficiency in high dimensional nearest neighbor ...
Sort
View
COCOON
1998
Springer
13 years 9 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
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...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 6 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
IS
2006
13 years 4 months ago
High dimensional nearest neighbor searching
As databases increasingly integrate different types of information such as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of mult...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
DAWAK
2005
Springer
13 years 10 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
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...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
ICCV
2007
IEEE
14 years 6 months ago
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...
Dusan Omercevic, Ondrej Drbohlav, Ales Leonardis