Sciweavers

102 search results - page 9 / 21
» Bounded Query Functions with Limited Output Bits
Sort
View
20
Voted
FOCS
2005
IEEE
14 years 1 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
ICDT
1999
ACM
133views Database» more  ICDT 1999»
13 years 11 months ago
A Framework for the Investigation of Aggregate Functions in Database Queries
Abstract. In this paper we present a new approach for studying aggregations in the context of database query languages. Starting from a broad de nition of aggregate function, we ad...
Luca Cabibbo, Riccardo Torlone
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 11 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
WWW
2005
ACM
14 years 8 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
DASFAA
2008
IEEE
168views Database» more  DASFAA 2008»
14 years 2 months ago
SemanticTwig: A Semantic Approach to Optimize XML Query Processing
Twig pattern matching (TPM) is the core operation of XML query processing. Existing approaches rely on either efficient data structures or novel labeling/indexing schemes to reduce...
Zhifeng Bao, Tok Wang Ling, Jiaheng Lu, Bo Chen