564 search results - page 49 / 113 » Error-tolerant Tree Matching |
142
Voted
CIKM
2004
Springer
15 years 9 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
126
Voted
EUSFLAT
2001
15 years 4 months ago
2001
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
104
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
106
click to vote
GRAPHICSINTERFACE
1997
15 years 4 months ago
1997
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
122
click to vote
COMPGEOM
1993
ACM
15 years 7 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...