1423 search results - page 157 / 285 » Languages of Nested Trees |
139
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
134
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
152
click to vote
LPAR
2001
Springer
15 years 8 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
148
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
126
click to vote
RTA
2010
Springer
15 years 7 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...