Sciweavers

1245 search results - page 139 / 249
» Binary Sparse Coding
Sort
View
109
Voted
TIT
2011
119views more  TIT 2011»
14 years 10 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
130
Voted
ICIP
2006
IEEE
16 years 5 months ago
Theoretical Model of the Coding Error in MCWT Video Coders
In motion-compensated wavelet based video coders (MCWT), it is known that a precise motion estimation is necessary to minimize the wavelet coefficients energy. However, a motion v...
Marie Andrée Agostini, Marc Antonini
118
Voted
DCC
2005
IEEE
16 years 3 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
130
Voted
ACSAC
2006
IEEE
15 years 9 months ago
PolyUnpack: Automating the Hidden-Code Extraction of Unpack-Executing Malware
Modern malware often hide the malicious portion of their program code by making it appear as data at compiletime and transforming it back into executable code at runtime. This obf...
Paul Royal, Mitch Halpin, David Dagon, Robert Edmo...
101
Voted
IMC
2006
ACM
15 years 9 months ago
Finding diversity in remote code injection exploits
Remote code injection exploits inflict a significant societal cost, and an active underground economy has grown up around these continually evolving attacks. We present a method...
Justin Ma, John Dunagan, Helen J. Wang, Stefan Sav...