Information storage in sparsely coded memory nets

DOI10.1088/0954-898X/1/1/005zbMath0825.68368OpenAlexW4249913541MaRDI QIDQ4034533

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)

Related Items (7)

Optimal learning rules for familiarity detection ⋮ Improving recall from an associative memory ⋮ Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory ⋮ Storing Object-Dependent Sparse Codes in a Willshaw Associative Network ⋮ Efficient Associative Computation with Discrete Synapses ⋮ Quantifying Neurotransmission Reliability Through Metrics-Based Information Analysis ⋮ Sparse distributed memory using \(N\)-of-\(M\) codes

This page was built for publication: Information storage in sparsely coded memory nets