Sciweavers

28 search results - page 5 / 6
» Some Recent Results on Local Testing of Sparse Linear Codes
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 5 months ago
Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
Salah A. Aly, Ahmed E. Kamal
CASES
2003
ACM
13 years 10 months ago
Exploiting bank locality in multi-bank memories
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, M...
BMCV
2000
Springer
13 years 9 months ago
The Spectral Independent Components of Natural Scenes
Abstract. We apply independent component analysis (ICA) for learning an efficient color image representation of natural scenes. In the spectra of single pixels, the algorithm was a...
Te-Won Lee, Thomas Wachtler, Terrence J. Sejnowski
FOCS
2010
IEEE
13 years 3 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
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 3 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama