✦ LIBER ✦

A cache for an associative memory

✍ Scribed by Willard L. Miranker

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 332 KB
Volume: 251
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(95)00606-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Operation of an associative memory

✍ M.R. Sayeh; R. Athinarayanan; M.R. Zargham 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

A cryogenic associative memory

✍ C.C. Yang; Julius T. Tou 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 739 KB

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

Extension from a linear associative memo

Extension from a linear associative memory to a linguistic linear associative memory

✍ A. Blanco; M. Delgado; W. Fajardo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

## Ẃe present a linguistic extension from a crisp model by using a codification model that allows us to implement a fuzzy system on a discrete decision model. The paper begins with an introduction to the representation of fuzzy information, followed by a discussion of the codification method and t

A new coding procedure for Bidirectional

A new coding procedure for Bidirectional Associative Memory

✍ M.J. Abedin; S.I. Ahson 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 162 KB

Adaptive quick learning for associative

Adaptive quick learning for associative memory

✍ Tomoshige Yoshihara; Masafumi Hagiwara 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

Bidirectional associative memory (BAM) is a a form of heteroassociative memory that can recall and restore patterns. Being a Hebbian learning-based memory, it has the problem of very low capacity. A training paradigm called the Pseudo-Relaxation Learning Algorithm (PRLAB) greatly increases the memor

A new neural associative memory model

✍ Patrik Floréen 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 664 KB

We present a new associative memory model based on the Hamming memory, but where the winner-take-all network part is replaced by a layer of nodes with somewhat complex node functions. This new memory can produce output vectors with individual "don't know" bits. The simulations demonstrate that this