350 search results - page 2 / 70 » Lower and upper bounds on obtaining history independence |
TCC
2005
Springer
13 years 11 months ago
2005
Springer
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
AMW
2009
13 years 7 months ago
2009
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
STACS
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...