Sciweavers

179 search results - page 27 / 36
» eccc 2010
Sort
View
ECCC
2007
100views more  ECCC 2007»
13 years 7 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
ECCC
2000
120views more  ECCC 2000»
13 years 7 months ago
A Complete Problem for Statistical Zero Knowledge
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
Amit Sahai, Salil P. Vadhan
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
ECCC
2000
59views more  ECCC 2000»
13 years 7 months ago
A Simple Model for Neural Computation with Firing Rates and Firing Correlations
A simple extension of standard neural network models is introduced which provides a model for neural computations that involve both firing rates and firing correlations. Such an ex...
Wolfgang Maass
ECCC
2000
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass