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 capaci
Molecular associative memory
โ Scribed by A.S. Mikhailov; I.V. Mit'kov; N.A. Sveshnikov
- Book ID
- 103679420
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 333 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0303-2647
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
A. new associative memory system composed of persistent-current bit-cells is developed. Each word of the memory system is associated with a selection and control network which is made up of only seven cryotrons. In the proposed system both reading and writing circuits are derived from three-terminal