Sciweavers

412 search results - page 31 / 83
» New Set of Codes for the Maximum-Likelihood Decoding Problem
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
15 years 10 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
83
Voted
ICCAD
1997
IEEE
129views Hardware» more  ICCAD 1997»
15 years 1 months ago
A fast and robust exact algorithm for face embedding
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
Evguenii I. Goldberg, Tiziano Villa, Robert K. Bra...
ICIP
2006
IEEE
15 years 11 months ago
Mesh-Based Motion-Compensated Interpolation for Side Information Extraction in Distributed Video Coding
1 This paper addresses the problem of side information generation in distributed video compression (DVC) schemes. Intermediate frames constructed by motioncompensated interpolation...
Denis Kubasov, Christine Guillemot
69
Voted
MDM
2007
Springer
15 years 3 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
ICC
2009
IEEE
176views Communications» more  ICC 2009»
15 years 4 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...