558 search results - page 16 / 112 » Trees and Matchings |
ACL
2003
15 years 1 months ago
2003
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
KDD
2002
ACM
16 years 4 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 ...
107
click to vote
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
104
click to vote
LATA
2009
Springer
15 years 6 months ago
2009
Springer
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 rest...
ARSCOM
2008
14 years 12 months ago
2008
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...