Sciweavers

3750 search results - page 127 / 750
» Code Optimization for Code Compression
Sort
View
SCCC
2002
IEEE
15 years 7 months ago
Improved Antidictionary Based Compression
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
Maxime Crochemore, Gonzalo Navarro
113
Voted
PPOPP
2003
ACM
15 years 8 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
116
Voted
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 2 months ago
Estimation of the Rate-Distortion Function
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Matthew T. Harrison, Ioannis Kontoyiannis
ITC
2002
IEEE
83views Hardware» more  ITC 2002»
15 years 7 months ago
Packet-Based Input Test Data Compression Techniques
1 This paper presents a test input data compression technique, which can be used to reduce input test data volume, test time, and the number of required tester channels. The techni...
Erik H. Volkerink, Ajay Khoche, Subhasish Mitra
158
Voted
ICC
2009
IEEE
166views Communications» more  ICC 2009»
15 years 9 months ago
A Cross-Layer Perspective on Rateless Coding for Wireless Channels
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...
Thomas A. Courtade, Richard D. Wesel