Sciweavers

1663 search results - page 181 / 333
» Compositional Service Trees
Sort
View
LICS
2005
IEEE
16 years 8 days ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
ACL
1990
15 years 7 months ago
Lexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentence...
Anne Abeillé
PODS
2005
ACM
99views Database» more  PODS 2005»
16 years 6 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
IPPS
1998
IEEE
15 years 11 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
ESCIENCE
2005
IEEE
16 years 9 days ago
Distributed, Parallel Web Service Orchestration Using XSLT
GridXSLT is an implementation of the XSLT programming language designed for distributed web service orchestration. Based on the functional semantics of the language, it compiles p...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...