Sciweavers

54 search results - page 10 / 11
» On Deciding Topological Classes of Deterministic Tree Langua...
Sort
View
ICDT
2007
ACM
141views Database» more  ICDT 2007»
13 years 12 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
FLOPS
2010
Springer
13 years 4 months ago
A Skeleton for Distributed Work Pools in Eden
We present a flexible skeleton for implementing distributed work pools in our parallel functional language Eden. The skeleton manages a pool of tasks (work pool) in a distributed ...
Mischa Dieterle, Jost Berthold, Rita Loogen
COMPGEOM
2011
ACM
12 years 9 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
PODS
2008
ACM
110views Database» more  PODS 2008»
14 years 5 months ago
Static analysis of active XML systems
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...
Serge Abiteboul, Luc Segoufin, Victor Vianu
LICS
2009
IEEE
14 years 12 days ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos