Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > EDUARDO D. SONTAG:
All reports by Author Eduardo D. Sontag:

TR06-137 | 13th November 2006
Prashant Joshi, Eduardo D. Sontag

Computational aspects of feedback in neural circuits

It had previously been shown that generic cortical microcircuit
models can perform complex real-time computations on continuous
input streams, provided that these computations can be carried out
with a rapidly fading memory. We investigate in this article the
computational capability of such circuits in the ... more >>>


TR06-010 | 1st December 2005
Reka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag

Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs

In this paper we consider the p-ary transitive reduction (TR<sub>p</sub>) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of experimental observations with a goal to minimize false positive inferences even if risking false negatives. ... more >>>


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 >>>


TR97-052 | 11th November 1997
Eduardo D. Sontag

Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages

We consider recurrent analog neural nets where the output of each
gate is subject to Gaussian noise, or any other common noise
distribution that is nonzero on a large set.
We show that many regular languages cannot be recognized by
networks of this type, and
more >>>




ISSN 1433-8092 | Imprint