Sciweavers

2925 search results - page 410 / 585
» Information Complexity of Online Problems
Sort
View
TIT
2010
154views Education» more  TIT 2010»
14 years 11 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...
SIGMOD
2001
ACM
121views Database» more  SIGMOD 2001»
16 years 4 months ago
XML Document Versioning
Managing multiple versions of XML documents represents an important problem, because of many applications ranging from traditional ones, such as software configuration control, to...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
IPSN
2009
Springer
15 years 11 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 10 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
FOCS
2003
IEEE
15 years 9 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis