Sciweavers

1000 search results - page 163 / 200
» Dependency Tree Automata
Sort
View
ICDCS
2000
IEEE
14 years 2 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
FOIKS
2008
Springer
14 years 9 days ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
GEOINFO
2003
14 years 4 days ago
Modelling Spatial Relations by Generalized Proximity Matrices
One of the main challenges for the development of spatial information theory is the formalization of the concepts of space and spatial relations. Currently, most spatial data struc...
Ana Paula Dutra de Aguiar, Gilberto Câmara, ...
PLDI
2011
ACM
13 years 1 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
15 years 3 days ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...