Sparse distributed memory using N-of-M codes
From MaRDI portal
Recommendations
Cites work
- Correlation Matrix Memories
- Delay-insensitive codes - an overview
- scientific article; zbMATH DE number 42973 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states
- Information storage in sparsely coded memory nets
Cited in
(7)- Fast retraining from SDM
- Increasing the semantic storage density of sparse distributed memory
- Binding and normalization of binary sparse distributed representations by context-dependent thinning
- KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
- scientific article; zbMATH DE number 42973 (Why is no real title available?)
- Integer sparse distributed memory: analysis and results
- Machine Learning: ECML 2004
This page was built for publication: Sparse distributed memory using \(N\)-of-\(M\) codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705592)