906 search results - page 73 / 182 » Matching Subsequences in Trees |
IANDC
2011
13 years 4 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
IJCGA
2006
13 years 9 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper presents a new geometric framework for analysis of planar treelike shapes for applications such as shape matching, recognition and morphology, using the geometry of the...
ICDM
2006
IEEE
14 years 3 months ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...