A model of analogue \(K\)-winners-take-all neural circuit
From MaRDI portal
Publication:2510737
DOI10.1016/j.neunet.2013.01.013zbMath1293.94139OpenAlexW2024407712WikidataQ51243985 ScholiaQ51243985MaRDI QIDQ2510737
Publication date: 4 August 2014
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2013.01.013
resolutionconvergence timeanalogue \(K\)-winners-take-all neural circuitdynamic shiftfunctional block-diagram
Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Analytic circuit theory (94C05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Central clustering of attributed graphs
- Support vector classifiers via gradient systems with discontinuous righthand sides
- Sliding modes in control and optimization. Transl. from the Russian
- Discontinuous differential equations. I
- Matrix-theoretic conditions for the realizability of sliding manifolds
- KWTA networks and their applications
- Two \(k\)-winners-take-all networks with discontinuous activation functions
- Problem of absolute stability
- Stable computational dynamics for a class of circuits with O(N) interconnections capable of KWTA and rank extractions
- Neurons with graded response have collective computational properties like those of two-state neurons.
- Differential equations with discontinuous right-hand side
- Principles of Artificial Neural Networks
This page was built for publication: A model of analogue \(K\)-winners-take-all neural circuit