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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient… 
2008
2008
Department of MathematicsWashington University in St. LouisSt. Louis, MO 63130.bmaurizi@math.wustl.eduOctober 22, 2005AbstractIn… 
2008
2008
M-tree je centralizovana indexova struktura pro podobnostni vyhledavani v metrickem prostoru. 
2007
2007
Metric trees are designed for improving efficiency of similarity search in high dimensional data. Searching a metric tree always… 
2007
2007
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 main purpose of this paper is to study the fixed point property of non-metric tree-like continua. Using the inverse systems… 
2005
2005
Image retrieval is a common problem in many computer vision applications and the literature abounds with techniques with… 
2004
2004
This work offers some improvements in the current distance-based indexing techniques. An optimal similarity search algorithm that… 
Highly Cited
2003
Highly Cited
2003
Similarity search structures for metric data typically bound object partitions by ball regions. Since regions can overlap, a… 
2003
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of…