2492 search results - page 119 / 499 » On the General Signature Trees |
183
click to vote
ALENEX
2010
15 years 7 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...
161
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
160
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
167
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
168
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...