Skip to search formSkip to main contentSkip to account menu

Cover tree

Known as: Cover trees 
The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed-up of a nearest neighbor search… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Computer scienceData structureList of data structuresMetric tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Tight Bound of Incremental Cover Trees for Dynamic Diversification
Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important… 
2015
2015
Erratum to: Forest development phases as an integrating tool to describe habitat preferences of breeding birds in lowland beech forests
2014
2014
k-NN Regression on Functional Data with Incomplete Observations
In this paper we study a general version of regression where each covariate itself is a functional data such as distributions or… 
2013
2013
Connected Target Coverage for Fully Data Gathering in Wireless Sensor Networks
Coverage problem is an important issue in wireless sensor networks, which has a great impact on the performance of wireless… 
2013
2013
Improving the running time of the nearest neighbor algorithm
Nearest neighbor algorithm is a well-known method, in pattern recognition, for classifying objects based on the nearest examples… 
2011
2011
Fast Parallel and Adaptive Updates for Dual-Decomposition Solvers
Dual-decomposition (DD) methods are quickly becoming important tools for estimating the minimum energy state of a graphical… 
2011
2011
Incremental manifold learning by spectral embedding methods
2010
2010
Design and Implementation of Cover Tree Algorithm on CUDA-Compatible GPU
Recently developed architecture such as Compute Unified Device Architecture (CUDA) allows us to exploit the computational power… 
Highly Cited
2009
Highly Cited
2009
Face Recognition with Local Binary Patterns, Spatial Pyramid Histograms and Naive Bayes Nearest Neighbor Classification
Face recognition algorithms commonly assume that face images are well aligned and have a similar pose -- yet in many practical… 
1996
1996
Triangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)