3898 search results - page 44 / 780 » On the Bit Extraction Problem |
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. T...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
100
click to vote
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...