Sciweavers

688 search results - page 24 / 138
» Types for trees
Sort
View
86
Voted
CGF
2002
116views more  CGF 2002»
15 years 16 days ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 2 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
93
Voted
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 23 days ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot
IJCAI
2003
15 years 2 months ago
Expressive Power of Tree and String Based Wrappers
There exist two types of wrappers: the string based wrapper such as the LR wrapper, and the tree based wrapper. A tree based wrapper designates extraction regions by nodes on the ...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa
81
Voted
WEA
2009
Springer
92views Algorithms» more  WEA 2009»
15 years 7 months ago
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come f...
Mark de Berg, Peter Hachenberger