10666 search results - page 1954 / 2134 » Quantum programming languages |
139
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...
127
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
123
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...
155
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...