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
β¦ 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
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
Fast implementation of partial Gram-Schm
β
Manzur Ali Ajiz; Mansoor Ahmed Al-Aali; Mohd Mustafa Hamed
π
Article
π
1993
π
Elsevier Science
π
English
β 837 KB
Myoelectric control of a computer animat
β
Sebelius, F.; Eriksson, L.; Balkenius, C.; Laurell, T.
π
Article
π
2006
π
Informa plc
π
English
β 439 KB
SPIE Proceedings [SPIE SPIE Medical Imag
β
Habert, SΓ©verine; Khurd, Parmeshwar; Chefd'hotel, Christophe; Ourselin, Sebastie
π
Article
π
2013
π
SPIE
β 636 KB
[IEEE 2012 IEEE 12th International Confe
β
Takai, Keiji
π
Article
π
2012
π
IEEE
β 277 KB