134 search results - page 23 / 27 » Using Regular Tree Automata as XML Schemas |
142
click to vote
ISCI
2008
15 years 4 months ago
2008
The Semantic Web is the next step of the current Web where information will become more machine-understandable to support effective data discovery and integration. Hierarchical sc...
160
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
156
click to vote
JCSS
2008
15 years 4 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
150
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Many proteomics initiatives require a seamless bioinformatics integration of a range of analytical steps between sample collection and systems modeling immediately ass...
139
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...