Sciweavers

28 search results - page 1 / 6
» Some Recent Results on Local Testing of Sparse Linear Codes
Sort
View
PROPERTYTESTING
2010
13 years 2 months ago
Some Recent Results on Local Testing of Sparse Linear Codes
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
Swastik Kopparty, Shubhangi Saraf
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
13 years 11 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
ECCV
2010
Springer
13 years 8 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ECCC
2011
171views ECommerce» more  ECCC 2011»
12 years 7 months ago
Testing Linear Properties: Some general themes
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
Madhu Sudan
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
13 years 11 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf