Sciweavers

103 search results - page 11 / 21
» Private Locally Decodable Codes
Sort
View
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Coding Artifact Reduction using Non-Reference Block Grid Visibility Measure
In this work a new method is proposed for coding artifact reduction of MPEG compressed video sequences. The method makes use of a simple cost-effective technique that allows the b...
Ihor O. Kirenko, Remco Muijs, Ling Shao
IJCNN
2006
IEEE
14 years 1 months ago
Backpropagation for Population-Temporal Coded Spiking Neural Networks
Abstract— Supervised learning rules for spiking neural networks are currently only able to use time-to-first-spike coding and are plagued by very irregular learning curves due t...
Benjamin Schrauwen, Jan M. Van Campenhout
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 8 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ICMCS
2005
IEEE
82views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Globally Optimal Uneven Erasure-Protected Multi-Group Packetization of Scalable Codes
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
Sorina Dumitrescu, Xiaolin Wu
FOCS
2010
IEEE
13 years 5 months ago
A Fourier-Analytic Approach to Reed-Muller Decoding
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
Parikshit Gopalan