2520 search results - page 14 / 504 » The complexity of approximating entropy |
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Compression ratio and computational complexity are two major factors for a successful image coder. By exploring the Laplacian distribution of the wavelet coefficients, a new bit ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
SSWMC
2004
13 years 11 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
TSP
2011
13 years 4 months ago
2011
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...