A basic compositional model for spiking neural networks
From MaRDI portal
Publication:6108904
DOI10.1007/978-3-031-15629-8_22zbMath1524.68135arXiv1808.03884MaRDI QIDQ6108904
Publication date: 26 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03884
Learning and adaptive systems in artificial intelligence (68T05) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
Cites Work
- Hybrid I/O automata.
- On the complexity of learning for spiking neurons with temporal coding.
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- The Theory of Timed I/O Automata
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks
- A neural algorithm for a fundamental computing problem
- Front Matter, Table of Contents, Preface, Conference Organization
- Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons.
- Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
- What Can a Neuron Learn with Spike-Timing-Dependent Plasticity?
- A logical calculus of the ideas immanent in nervous activity
- Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks.
- Learning hierarchically-structured concepts
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A basic compositional model for spiking neural networks