46 search results - page 3 / 10 » Exact XML Type Checking in Polynomial Time |
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
ICTCS
2005
Springer
13 years 11 months ago
2005
Springer
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
PPSWR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...