Sciweavers

3750 search results - page 253 / 750
» Code Optimization for Code Compression
Sort
View
140
Voted
ICIP
2004
IEEE
16 years 5 months ago
Progressive polygon encoding of segmentation maps
A new method for the lossy compression of segmentation maps is presented. In the first stage of the proposed algorithm, region boundary segments are coded, providing a coarse poly...
Marc Servais, Theodore Vlachos, Thomas Davies
DYNAMO
2000
74views more  DYNAMO 2000»
15 years 5 months ago
A framework for remote dynamic program optimization
Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applie...
Michael Voss, Rudolf Eigenmann
EVOW
2007
Springer
15 years 10 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
128
Voted
DCC
2008
IEEE
16 years 3 months ago
Skew Hadamard designs and their codes
Skew Hadamard designs (4n-1, 2n-1, n-1) are associated to order 4n skew Hadamard matrices in the natural way. We study the codes spanned by their incidence matrices A and by I +A a...
Jon-Lark Kim, Patrick Solé
SIGMETRICS
1998
ACM
15 years 8 months ago
Modeling Set Associative Caches Behavior for Irregular Computations
While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An i...
Basilio B. Fraguela, Ramon Doallo, Emilio L. Zapat...