Sciweavers

672 search results - page 1 / 135
» Almost Optimal Dispersers
Sort
View
STOC
1998
ACM
141views Algorithms» more  STOC 1998»
13 years 9 months ago
Almost Optimal Dispersers
Amnon Ta-Shma
STACS
2005
Springer
13 years 10 months ago
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
Eran Rom, Amnon Ta-Shma
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
13 years 8 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
13 years 10 months ago
On the Error Parameter of Dispersers
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon ...
AAECC
2003
Springer
119views Algorithms» more  AAECC 2003»
13 years 10 months ago
Optimal 2-Dimensional 3-Dispersion Lattices
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
Moshe Schwartz, Tuvi Etzion