Sciweavers

437 search results - page 43 / 88
» Randomized Lattice Decoding
Sort
View
JOC
2002
99views more  JOC 2002»
14 years 11 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
85
Voted
ICIP
2005
IEEE
16 years 1 months ago
Two-channel predictive multiple description coding
This paper presents a multiple description (MD) video codec based on the principles side-information coding. In particular, we highlight certain key components of the codec design...
Ashish Jagmohan, Anshul Sehgal, Narendra Ahuja
83
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
89
Voted
FOCS
2006
IEEE
15 years 5 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
TCSV
2008
134views more  TCSV 2008»
14 years 11 months ago
Efficient Multiple-Description Image Coding Using Directional Lifting-Based Transform
This paper proposes an efficient two-description image coding technique. The two side descriptions of an image are generated by quincunx subsampling. The decoding from any side des...
Nan Zhang 0006, Yan Lu, Feng Wu, Xiaolin Wu, Baoca...