Sciweavers

655 search results - page 38 / 131
» Automata, Logic, and XML
Sort
View
FORMATS
2004
Springer
15 years 3 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
LPAR
2005
Springer
15 years 3 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
FOIKS
2008
Springer
14 years 11 months 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
ADL
1997
Springer
125views Digital Library» more  ADL 1997»
15 years 1 months ago
Error Tolerant Document Structure Analysis
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
Bertin Klein, Peter Fankhauser
SAC
2004
ACM
15 years 3 months ago
On using collection for aggregation and association relationships in XML object-relational storage
XML data can be stored in different databases including ObjectRelational Database (ORDB). Using ORDB, we get the benefit of the relational maturity and the richness of OO modeling...
Eric Pardede, J. Wenny Rahayu, David Taniar