Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Approximate string matchingBK-treeBinary search algorithmCover tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Skeletal Rigidity of Phylogenetic Trees
Motivated by geometric origami and the straight skeleton construction, we outline a map between spaces of phylogenetic trees and… 
2008
2008
M-tree: Metric tree
M-tree je centralizovana indexova struktura pro podobnostni vyhledavani v metrickem prostoru. 
2008
2008
Metric Trees, Hyperconvex Hulls and Extensions
Department of MathematicsWashington University in St. LouisSt. Louis, MO 63130.bmaurizi@math.wustl.eduOctober 22, 2005AbstractIn… 
2007
2007
Fixed Points of Uniformly Lipschitzian Mappings in Metric Trees
In this paper we examine the basic structure of metric trees and prove fixed point theorems for uniformly Lipschitzian mappings… 
2007
2007
Adaptive similarity search in metric trees
Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always… 
2007
2007
MAMCost: Global and Local Estimates leading to Robust Cost Estimation of Similarity Queries
This paper presents an effective cost model to estimate the number of disk accesses (I/O cost) and the number of distance… 
2005
2005
The fixed point property for arc component preserving mappings of non-metric tree-like continua
The main purpose of this paper is to study the fixed point property of non-metric tree-like continua. Using the inverse systems… 
2004
2004
Improvements in distance-based indexing
This work offers some improvements in the current distance-based indexing techniques. An optimal similarity search algorithm that… 
Highly Cited
2003
Highly Cited
2003
Region proximity in metric spaces and its use for approximate similarity search
Similarity search structures for metric data typically bound object partitions by ball regions. Since regions can overlap, a… 
2003
2003
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of… 
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)