Sciweavers

10666 search results - page 1954 / 2134
» Quantum programming languages
Sort
View
ICALP
2007
Springer
16 years 16 days ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
ICALP
2007
Springer
16 years 16 days ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor
ICALP
2007
Springer
16 years 16 days ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
ICALP
2007
Springer
16 years 16 days ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
ICALP
2007
Springer
16 years 16 days ago
Approximation by DNF: Examples and Counterexamples
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
Ryan O'Donnell, Karl Wimmer
« Prev « First page 1954 / 2134 Last » Next »