State-Dependent Computation Using Coupled Recurrent Networks
From MaRDI portal
Publication:3612130
DOI10.1162/neco.2008.03-08-734zbMath1178.68460OpenAlexW2143614307WikidataQ46051154 ScholiaQ46051154MaRDI QIDQ3612130
Ueli Rutishauser, Rodney J. Douglas
Publication date: 3 March 2009
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:RUTnc89
Related Items (9)
Competition for synchronization in a phase oscillator system ⋮ Anatomical Constraints on Lateral Competition in Columnar Cortical Architectures ⋮ Collective dynamics and bifurcations in symmetric networks of phase oscillators. II ⋮ Feedforward Approximations to Dynamic Recurrent Network Architectures ⋮ Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks ⋮ The wake-sleep `phase transition' at the gate to consciousness ⋮ A Multifactor Winner-Take-All Dynamics ⋮ Collective Stability of Networks of Winner-Take-All Circuits ⋮ A Systematic Method for Configuring VLSI Networks of Spiking Neurons
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Spiking neurons and the induction of finite state machines.
- Computational Design and Nonlinear Dynamics of a Recurrent Network Model of the Primary Visual Cortex*
- Dynamical Stability Conditions for Recurrent Neural Networks with Unsaturating Piecewise Linear Transfer Functions
- Absolute stability of global pattern formation and parallel memory storage by competitive neural networks
- Constructing deterministic finite-state automata in recurrent neural networks
- Contour Enhancement, Short Term Memory, and Constancies in Reverberating Neural Networks
- Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
- Bayesian Computation in Recurrent Neural Circuits
- Neurons with graded response have collective computational properties like those of two-state neurons.
This page was built for publication: State-Dependent Computation Using Coupled Recurrent Networks
