๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On associative memory

โœ Scribed by G. Palm


Book ID
104728608
Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
998 KB
Volume
36
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

โœฆ Synopsis


The information storing capacity of certain associative and auto-associative memories is calculated. For example, in a 100 X 100 matrix of 1 bit storage elements more than 6,500 bits can be stored associatively, and more than 688,000 bits in a 1,000 X 1,000 matrix. Asymptotically, the storage capacity of an associative memory increases proportionally to the number of storage elements. The usefulness of associative memories, as opposed to conventional listing memories, is duscussed -- especially in connection with brain modelling.


๐Ÿ“œ SIMILAR VOLUMES


Molecular associative memory
โœ A.S. Mikhailov; I.V. Mit'kov; N.A. Sveshnikov ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 333 KB
Complex associative memory
โœ Iku Nemoto; Makoto Kubono ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 682 KB
Continuous classifying associative memor
โœ Antonio B. Bailรณn; Miguel Delgado; Waldo Fajardo ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 295 KB
Error tolerant associative memory
โœ Cheng-Yuan Liou; Shao-Kuo Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 351 KB
Connectionist hashed associative memory
โœ Ronald L. Greene ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 586 KB

Greene, R.L., Connectionist hashed associative memory (Research Note), Artificial Intelligence 48 (1991) 87-98. This paper proposes the use of simple connectionist networks as hashing functions for sparse associative or content addressable memory. The robustness of such networks in the presence of n