Information storage in sparsely coded memory nets

DOI10.1088/0954-898X/1/1/005zbMATH Open0825.68368OpenAlexW4249913541MaRDI QIDQ4034533FDOQ4034533

Authors: Jean-Pierre Nadal, G. Toulouse 

Publication date: 16 May 1993

Full work available at URL: https://doi.org/10.1088/0954-898x/1/1/005

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)

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)