Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > UNIVERSAL APPROXIMATION THEOREM:
Reports tagged with universal approximation theorem:
TR00-031 | 31st May 2000
Eduardo D. Sontag

Neural Systems as Nonlinear Filters

Experimental data show that biological synapses behave quite
differently from the symbolic synapses in all common artificial
neural network models. Biological synapses are dynamic, i.e., their
``weight'' changes on a short time scale by several hundred percent
in dependence of the past input to the synapse. ... more >>>


TR00-032 | 31st May 2000

On the Computational Power of Winner-Take-All

In this paper the computational power of a new type of gate is studied:
winner-take-all gates. This work is motivated by the fact that the cost
of implementing a winner-take-all gate in analog VLSI is about the same
as that of implementing a threshold gate.

We show that ... more >>>




ISSN 1433-8092 | Imprint