Improved search heuristics for the sa-tree

DOI10.1016/S0167-8655(03)00122-3MaRDI QIDQ4458900zbMATH OpenFDO

Authors Gisli R. Hjaltason, Hanan Samet

Publication date 14 March 2004

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8655(03)00122-3

zbMATH Keywords

Metric spacesDistance-based indexingNearest neighbor algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The analysis of heuristics for search trees
• Improved approximation algorithms for the average-case tree searching problem
• scientific article; zbMATH DE number 4131689
• Efficient search algorithm on compact S-trees
• The analysis of a fringe heuristic for binary search trees
• Optimal Search in Trees
• scientific article; zbMATH DE number 4047146
• Constructing optimal search trees in optimal time

Cited in

(4)

• Dynamic spatial approximation trees
• Advances in metric embedding theory
• A Bottom-Up Distance-Based Index Tree for Metric Space
• Memory-adaptative dynamic spatial approximation trees.

This page was built for publication: Improved search heuristics for the sa-tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458900)