159 search results - page 29 / 32 » Fast Decoding and Optimal Decoding for Machine Translation |
STOC
2004
ACM
15 years 9 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
IH
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a new stochastic approach which can be applied with di erent watermark techniques. The approach is based on the computation of a Noise Visibility Function NVF ...
88
Voted
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
71
Voted
CRYPTO
2004
Springer
15 years 2 months ago
2004
Springer
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...