Sciweavers

598 search results - page 24 / 120
» Predicting Lattice Reduction
Sort
View
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 2 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
ASPDAC
2006
ACM
104views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Workload prediction and dynamic voltage scaling for MPEG decoding
– In this paper we present three efficient DVS techniques for an MPEG decoder. Their energy reduction is comparable to that of the optimal solution. A workload prediction model i...
Ying Tan, Parth Malani, Qinru Qiu, Qing Wu
ICASSP
2009
IEEE
15 years 10 months ago
Maximizing global entropy reduction for active learning in speech recognition
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
ICC
2009
IEEE
151views Communications» more  ICC 2009»
15 years 10 months ago
Improved Vector Perturbation with Modulo Loss Reduction for Multiuser Downlink Systems
— In this paper, we present an improved precoding technique which reduces a modulo loss in vector perturbation (VP) with low complexity for the downlink of a multiuser multiple-i...
Hyeon-Seung Han, Seokhwan Park, Inkyu Lee
JOC
2002
99views more  JOC 2002»
15 years 3 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski