Sciweavers

455 search results - page 60 / 91
» Multi-profile based code compression
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
14 years 3 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 3 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
CG
2004
Springer
13 years 10 months ago
Compression of soft-body animation sequences
We describe a compression scheme for the geometry component of 3D animation sequences. This scheme is based on the principle component analysis (PCA) method, which represents the ...
Zachi Karni, Craig Gotsman
TIT
2010
128views Education» more  TIT 2010»
13 years 4 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
JIPS
2010
273views more  JIPS 2010»
13 years 5 months ago
Hiding Secret Data in an Image Using Codeword Imitation
This paper proposes a novel reversible data hiding scheme based on a Vector Quantization (VQ) codebook. The proposed scheme uses the principle component analysis (PCA) algorithm to...
Zhi-Hui Wang, Chin-Chen Chang, Pei-Yu Tsai