21 search results - page 2 / 5 » Local Decoding and Testing for Homomorphisms |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
APPROX
2009
Springer
14 years 6 days ago
2009
Springer
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...
PROPERTYTESTING
2010
13 years 3 months ago
2010
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...
EMNLP
2008
13 years 7 months ago
2008
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...