Sciweavers

3735 search results - page 12 / 747
» Order compression schemes
Sort
View
CASES
2006
ACM
15 years 6 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
PC
1998
89views Management» more  PC 1998»
14 years 12 months ago
Analysis of Local Enumeration and Storage Schemes in HPF
In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...
Henk J. Sips, Will Denissen, Kees van Reeuwijk
99
Voted
DCC
1999
IEEE
15 years 4 months ago
Universal Lossless Source Coding with the Burrows Wheeler Transform
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a loss...
Michelle Effros
149
Voted
EDBT
2010
ACM
392views Database» more  EDBT 2010»
15 years 6 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
88
Voted
CAIP
2001
Springer
15 years 4 months ago
A Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
Maciej Bartkowiak, Adam Luczak