Sciweavers

168 search results - page 17 / 34
» Binary Codes for Non-Uniform Sources
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
CGO
2009
IEEE
14 years 2 months ago
Transparent Debugging of Dynamically Optimized Code
Debugging programs at the source level is essential in the software development cycle. With the growing importance of dynamic optimization, there is a clear need for debugging sup...
Naveen Kumar, Bruce R. Childers, Mary Lou Soffa
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 4 months ago
Secret Sharing LDPC Codes for the Constrained Gaussian Wiretap Channel
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presenc...
Chan Wong Wong, Tan F. Wong, John M. Shea
CASES
2004
ACM
14 years 25 days 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 ...
DIMVA
2010
13 years 8 months ago
HookScout: Proactive Binary-Centric Hook Detection
Abstract. In order to obtain and maintain control, kernel malware usually makes persistent control flow modifications (i.e., installing hooks). To avoid detection, malware develope...
Heng Yin, Pongsin Poosankam, Steve Hanna, Dawn Xia...