Efficient Associative Computation with Discrete Synapses
From MaRDI portal
Publication:5380385
Recommendations
- scientific article; zbMATH DE number 761425
- Computing with discrete multi-valued neurons
- On discrete-time cellular neural networks for associative memories
- scientific article; zbMATH DE number 615129
- On the computational power of discrete Hopfield nets
- A computationally efficient abstraction of long-term potentiation
- On the computational power of circuits of spiking neurons
- scientific article; zbMATH DE number 1300101
Cites work
- scientific article; zbMATH DE number 5506204 (Why is no real title available?)
- scientific article; zbMATH DE number 35310 (Why is no real title available?)
- scientific article; zbMATH DE number 42973 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3551942 (Why is no real title available?)
- scientific article; zbMATH DE number 2033162 (Why is no real title available?)
- scientific article; zbMATH DE number 1559577 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- A familiarity discrimination algorithm inspired by computations of the perirhinal cortex
- A model of cortical associative memory based on a horizontal network of connected columns
- Associative memory: on the (puzzling) sparse coding limit
- Can programming be liberated from the von Neumann style?
- Capacity and information efficiency of the associative net
- Capacity of neural networks with discrete synaptic couplings
- Die Lernmatrix
- Effective neuronal learning with ineffective Hebbian learning rules
- Imposing Biological Constraints onto an Abstract Neocortical Attractor Network Model
- Information storage in sparsely coded memory nets
- Inhomogeneities in Heteroassociative Memories with Linear Learning Rules
- Memory Capacities for Synaptic and Structural Plasticity
- Neural Associative Memory and the Willshaw–Palm Probability Distribution
- Neural associative memory for brain modeling and information retrieval
- Neural associative memory with optimal Bayesian learning
- Neural networks and physical systems with emergent collective computational abilities
- On associative memory
- Optimising synaptic learning rules in linear associative memories
- Run-length encodings (Corresp.)
- The existence of persistent states in the brain
- The space of interactions in neural network models
Cited in
(9)- Neural associative memory with optimal Bayesian learning
- Storing object-dependent sparse codes in a Willshaw associative network
- Iterative retrieval and block coding in autoassociative and heteroassociative memory
- Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
- Multiassociative memory: recurrent synapses increase storage capacity
- Neural Associative Memory and the Willshaw–Palm Probability Distribution
- Robust exponential memory in Hopfield networks
- Memorization and Association on a Realistic Neural Model
- GXNOR-Net: training deep neural networks with ternary weights and activations without full-precision memory under a unified discretization framework
This page was built for publication: Efficient Associative Computation with Discrete Synapses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380385)