We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In c...
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
A framework for recovering high-resolution video sequences from sub-sampled and compressed observations is presented. Compression schemes that describe a video sequence through a c...
Luis D. Alvarez, Rafael Molina, Aggelos K. Katsagg...
This paper addresses the problem of bit-rate conversion of MPEG compressed video. We present selective requantization, a method for reducing the requantization errors in transcodi...