Information storage in sparsely coded memory nets
From MaRDI portal
Publication:4034533
Cited in
(7)- Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
- Efficient Associative Computation with Discrete Synapses
- Sparse distributed memory using \(N\)-of-\(M\) codes
- Optimal learning rules for familiarity detection
- Storing object-dependent sparse codes in a Willshaw associative network
- Quantifying Neurotransmission Reliability Through Metrics-Based Information Analysis
- Improving recall from an associative memory
This page was built for publication: Information storage in sparsely coded memory nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034533)