Sciweavers

903 search results - page 159 / 181
» Non-well-founded trees in categories
Sort
View
DOCENG
2003
ACM
15 years 7 months ago
Set-at-a-time access to XML through DOM
To support the rapid growth of the web and e-commerce, W3C developed DOM as an application programming interface that the abstract, logical tree structure of an XML document. In t...
Hai Chen, Frank Wm. Tompa
126
Voted
DOCENG
2003
ACM
15 years 7 months ago
Lazy XSL transformations
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
Steffen Schott, Markus L. Noga
KCAP
2003
ACM
15 years 7 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
82
Voted
PODC
2003
ACM
15 years 7 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
PODC
2003
ACM
15 years 7 months ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler