Sciweavers

14248 search results - page 115 / 2850
» Queries
Sort
View
FOCS
2003
IEEE
14 years 2 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
SIGIR
2010
ACM
14 years 27 days ago
Estimating advertisability of tail queries for sponsored search
Sponsored search is one of the major sources of revenue for search engines on the World Wide Web. It has been observed that while showing ads for every query maximizes shortterm r...
Sandeep Pandey, Kunal Punera, Marcus Fontoura, Van...
CIKM
2008
Springer
13 years 11 months ago
Evaluating partial tree-pattern queries on XML streams
The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also the only option for a number of important XML application...
Xiaoying Wu, Dimitri Theodoratos
ESWS
2008
Springer
13 years 10 months ago
Querying Distributed RDF Data Sources with SPARQL
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
Bastian Quilitz, Ulf Leser
DAGSTUHL
2006
13 years 10 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum