Sciweavers

3898 search results - page 21 / 780
» On the Bit Extraction Problem
Sort
View
FOCS
2000
IEEE
15 years 2 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
DCC
2004
IEEE
15 years 9 months ago
Efficient Bit Allocation for Dependent Video Coding
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Yegnaswamy Sermadevi, Sheila S. Hemami
ICIP
2005
IEEE
15 years 11 months ago
Bit allocation and quantizer optimization in multiple description coding with oversampled filterbanks
Multiple Description coding has been recently proposed for images and video transmission in packet erasure channels because of its good loss recovery capability. In this paper, we...
Riccardo Bernardini, Luca Celetto, Roberto Rinaldo...
DATE
2006
IEEE
82views Hardware» more  DATE 2006»
15 years 3 months ago
Value-based bit ordering for energy optimization of on-chip global signal buses
In this paper, we present a technique that exploits the statistical behavior of data values transmitted on global signal buses to determine an energy-efficient ordering of bits t...
Krishnan Sundaresan, Nihar R. Mahapatra
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
15 years 2 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram