Sciweavers

654 search results - page 56 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
15 years 3 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
PVLDB
2010
134views more  PVLDB 2010»
15 years 1 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
AICOM
2004
100views more  AICOM 2004»
15 years 3 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 3 months ago
RDFViewS: A Storage Tuning Wizard for RDF Applications
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue. In this paper, we present RD...
François Goasdoué, Konstantinos Kara...
LWA
2007
15 years 4 months ago
The Effectiveness of Concept Based Search for Video Retrieval
In this paper we investigate how a small number of high-level concepts derived for video shots, such as Sports, Face, Indoor, etc., can be used effectively for ad hoc search in vi...
Claudia Hauff, Robin Aly, Djoerd Hiemstra