Sciweavers

3750 search results - page 225 / 750
» Code Optimization for Code Compression
Sort
View
137
Voted
CASES
2004
ACM
15 years 9 months ago
A post-compiler approach to scratchpad mapping of code
ScratchPad Memories (SPMs) are commonly used in embedded systems because they are more energy-efficient than caches and enable tighter application control on the memory hierarchy...
Federico Angiolini, Francesco Menichelli, Alberto ...
106
Voted
JSAC
2006
108views more  JSAC 2006»
15 years 3 months ago
Distributed Utility Maximization for Network Coding Based Multicasting: A Shortest Path Approach
One central issue in practically deploying network coding is the adaptive and economic allocation of network resource. We cast this as an optimization, where the net-utility
Yunnan Wu, Sun-Yuan Kung
132
Voted
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 5 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
118
Voted
DCC
2008
IEEE
16 years 3 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
146
Voted
CGO
2005
IEEE
15 years 9 months ago
Maintaining Consistency and Bounding Capacity of Software Code Caches
Software code caches are becoming ubiquitous, in dynamic optimizers, runtime tool platforms, dynamic translators, fast simulators and emulators, and dynamic compilers. Caching fre...
Derek Bruening, Saman P. Amarasinghe