662 search results - page 78 / 133 » Trees, Automata and XML |
156
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
162
click to vote
LICS
2007
IEEE
16 years 10 days ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
177
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
239
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
This paper investigates a class of transform queries proposed by XQuery Update [6]. A transform query is defined in terms of XML update syntax. When posed on an XML tree T, it ret...
176
Voted
JIDM
2010
15 years 4 months ago
2010
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...