807 search results - page 5 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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...
116
Voted
MOC
1998
14 years 9 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
KDD
2001
ACM
15 years 10 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for a...