Sciweavers

19 search results - page 4 / 4
» A Note About the Traceability Properties of Linear Codes
Sort
View
SIGSOFT
2007
ACM
14 years 6 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 9 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
TIT
2002
126views more  TIT 2002»
13 years 4 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
NIPS
2007
13 years 6 months ago
Receptive Fields without Spike-Triggering
Stimulus selectivity of sensory neurons is often characterized by estimating their receptive field properties such as orientation selectivity. Receptive fields are usually deriv...
Jakob Macke, Guenther Zeck, Matthias Bethge