Sciweavers

835 search results - page 117 / 167
» Structural Recursion as a Query Language
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
ICALP
2003
Springer
14 years 27 days ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf
PVLDB
2010
103views more  PVLDB 2010»
13 years 6 months ago
Probabilistic XML via Markov Chains
We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. ...
Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, P...
JASIS
2000
120views more  JASIS 2000»
13 years 7 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 7 months ago
DTD-Directed Publishing with Attribute Translation Grammars
We present a framework for publishing relational data in XML with respect to a fixed DTD. In data exchange on the Web, XML views of relational data are typically required to confo...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Raje...