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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important… 
2014
2014
In this paper we study a general version of regression where each covariate itself is a functional data such as distributions or… 
2013
2013
Coverage problem is an important issue in wireless sensor networks, which has a great impact on the performance of wireless… 
2013
2013
Nearest neighbor algorithm is a well-known method, in pattern recognition, for classifying objects based on the nearest examples… 
2013
2013
Gaussian process (GP) regression is a powerful technique for nonparametric regression; unfortunately, calculating the predictive… 
2011
2011
Dual-decomposition (DD) methods are quickly becoming important tools for estimating the minimum energy state of a graphical… 
2010
2010
Recently developed architecture such as Compute Unified Device Architecture (CUDA) allows us to exploit the computational power…