807 search results - page 14 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
100
Voted
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
85
Voted
ALGORITHMICA
2005
14 years 11 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
KDD
2002
ACM
16 years 2 days ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
IJWET
2008
14 years 11 months ago
2008
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...