A cache for an associative memory

DOI10.1016/0024-3795(95)00606-0MaRDI QIDQ5961697zbMATH OpenOpenAlexFDO

Authors Willard L. Miranker

Publication date 26 February 1997

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/0024-3795(95)00606-0

zbMATH Keywords

cacheassociative memory

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• Efficient and robust associative memory from a generalized Bloom filter
• scientific article; zbMATH DE number 4085057
• KANERVA’S SPARSE DISTRIBUTED MEMORY: AN ASSOCIATIVE MEMORY ALGORITHM WELL-SUITED TO THE CONNECTION MACHINE
• The capacity of the Hopfield associative memory
• scientific article; zbMATH DE number 446849

Cites work

• Acceleration by aggregation of successive approximation methods
• Self-organization and associative memory.
• The effectiveness of analogue ‘neural network’ hardware

Cited in

(1)

• scientific article; zbMATH DE number 512808 (Why is no real title available?)

This page was built for publication: A cache for an associative memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961697)