65 search results - page 4 / 13 » Some Results on Top-Context-Free Tree Languages |
PEPM
2011
ACM
12 years 10 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
EMNLP
2008
13 years 8 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...