141 search results - page 2 / 29 » Destruction of Very Simple Trees |
COLING
2002
13 years 5 months ago
2002
We discuss a grammar development process used to generate the trees of the wide-coverage Lexicalized Tree Adjoining Grammar (LTAG) for English of the XTAG Project. Result of the c...
VMCAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...