Sciweavers

108 search results - page 2 / 22
» Cover Trees for 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...
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 3 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
PR
2007
155views more  PR 2007»
13 years 4 months ago
Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
Yong-Sheng Chen, Yi-Ping Hung, Ting-Fang Yen, Chio...

Publication
417views
14 years 2 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos