Vantage-point tree

Known as: MVP tree, VP tree, Vp-tree 
A vantage-point tree (or VP tree) is a metric tree that segregates data in a metric space by choosing a position in the space (the "vantage point… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2017
02419932017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, an implementation of vantage point local search procedure for the Bees Algorithm (BA) in combinatorial domains is… (More)
  • table 1
  • figure 3
  • figure 2
  • figure 4
  • figure 7
Is this relevant?
2013
2013
Our focus is on approximate nearest neighbor retrieval in metric and non-metric spaces. We employ a VP-tree and explore two… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2011
2011
We develop and evaluate a version of the excluded middle vantage point forest in support of range searches and load balancing for… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2008
2008
Melodic search engines let people find music in online collections by specifying the desired melody. Comparing the query melody… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Index structures for nearest neighbor search in high-dimensional metric space are mostly built by partitioning the data set based… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 2
Is this relevant?
2008
2008
Similarity search (e.g., k-nearest neighbor search) in high-dimensional metric space is the key operation in many applications… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract. For some multimedia applications, it has been found that domain objects cannot be represented as feature vectors in a… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 7
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We formulate the content-based image indexing problem as a multi-dimensional nearest-neighbor search problem, and develop… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?