Sciweavers

1141 search results - page 17 / 229
» Gray Code Compression
Sort
View
DCC
2003
IEEE
15 years 11 months ago
Performance of universal codes over infinite alphabets
It is known that universal compression of strings generated by i.i.d. sources over infinite alphabets entails infinite per-symbol redundancy. Continuing previous work [1], we cons...
Alon Orlitsky, Narayana P. Santhanam
DATE
2004
IEEE
132views Hardware» more  DATE 2004»
15 years 3 months ago
LZW-Based Code Compression for VLIW Embedded Systems
We propose a new variable-sized-block method for VLIW code compression. Code compression traditionally works on fixed-sized blocks and its efficiency is limited by the small block...
Chang Hong Lin, Yuan Xie, Wayne Wolf
MICRO
1999
IEEE
102views Hardware» more  MICRO 1999»
15 years 4 months ago
Evaluation of a High Performance Code Compression Method
Compressing the instructions of an embedded program is important for cost-sensitive low-power control-oriented embedded computing. A number of compression schemes have been propos...
Charles Lefurgy, Eva Piccininni, Trevor N. Mudge
89
Voted
ICIP
2005
IEEE
16 years 1 months ago
Efficient coding of computer generated compound images
A new compound image compression algorithm is proposed, based on Shape Primitive Extraction and Coding (SPEC). The SPEC first segments a compound image into text/graphics pixels an...
Tony Lin, Pengwei Hao, Sang Uk Lee
DATESO
2009
158views Database» more  DATESO 2009»
14 years 9 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...