𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rule-driven processing of tree-structured data using pointed trees

✍ Scribed by Nikita Schmidt; Ahmed Patel


Book ID
114288306
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
349 KB
Volume
25
Category
Article
ISSN
0920-5489

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


SR-tree: An index structure for nearest-
✍ Norio Katayama; Shin'ichi Satoh πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 273 KB πŸ‘ 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

Enhanced layered segment trees: a pragma
✍ Gopal Racherla; Sridhar Radhakrishnan; B.John Oommen πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 112 KB

The data structure that is probably most used in the pattern recognition and image processing of geometric objects is the segment tree and its optimized variant, the "layered segment tree". In all the versions currently known, except the work of Vaishnavi and Wood described later, these data structu