Sciweavers

1845 search results - page 307 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 8 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 5 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 1 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
14 years 4 days ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
FOCS
1989
IEEE
14 years 3 days ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan