Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Metric tree

Known as: Metric trees 
A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Based on solid theoretical foundations, we present strong evidence that a number of real-world networks, taken from different… Expand
Is this relevant?
2015
2015
The Gromov-Hausdorff distance is a natural way to measure distance between two metric spaces. We give the first proof of hardness… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
The paper investigates the acceleration of t-SNE--an embedding technique that is commonly used for the visualization of high… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Metric Access Methods (MAM) are widely employed to speed up the evaluation of similarity queries, such as range and k-nearest… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
2007
2007
Spectral properties of the Schrodinger operator $ A_{\lambda} = -\Delta +\lambda V$ on regular metric trees are studied. It is… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Many recent database applications need to deal with similarity queries. For such applications, it is important to measure the… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Searching in a large data set those strings that are more similar, according to the edit distance, to a given one is a time… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses… Expand
  • table 2
  • figure 8
  • figure 9
  • figure 10
  • figure 11
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abstract Divide-and-conquer search strategies are described for satisfying proximity queries involving arbitrary distance metrics… Expand
Is this relevant?