Sciweavers

212 search results - page 6 / 43
» On the Locality of Codeword Symbols
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 8 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ECCC
2006
120views more  ECCC 2006»
13 years 8 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CVPR
2008
IEEE
13 years 10 months ago
Loose shape model for discriminative learning of object categories
We consider the problem of visual categorization with minimal supervision during training. We propose a partbased model that loosely captures structural information. We represent ...
Margarita Osadchy, Elran Morash
JSAC
1998
81views more  JSAC 1998»
13 years 8 months ago
Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
Brendan J. Frey, Frank R. Kschischang
ICIP
2006
IEEE
14 years 10 months ago
Tamper-Localization Watermarking with Systematic Error Correcting Code
Abstract-- This paper presents an authentication watermarking method which can localize the tampering regions in fine granularity. Unlike the previous block-wise Tampering-Localiza...
Yongdong Wu