Sciweavers

204 search results - page 15 / 41
» The Language, the Expression, and the (Small) Automaton
Sort
View
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 1 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
STACS
1994
Springer
13 years 11 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
LICS
2005
IEEE
14 years 1 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
JMLC
2000
Springer
13 years 11 months ago
Explicit Namespaces
A namespace is a mapping from labels to values. Most programming languages support different forms of namespaces, such as records, dictionaries, objects, environments, packages and...
Franz Achermann, Oscar Nierstrasz
AAAI
1996
13 years 8 months ago
Spatial Aggregation: Language and Applications
This paper describes the spatial aggregation language and its applications. Spatial aggregation comprises a framework and a mechanism for organizing computations around image-like...
Christopher Bailey-Kellogg, Feng Zhao, Kenneth Yip