𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Character recognition in a sparse distributed memory

✍ Scribed by Hong, Y.-S.; Chen, S.-S.

Book ID
114550847
Publisher
Institute of Electrical and Electronics Engineers
Year
1991
Weight
463 KB
Volume
21
Category
Article
ISSN
0018-9472

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Investigating the sparse simplex algorit
Investigating the sparse simplex algorithm on a distributed memory multiprocessor
✍ I. Maros; G. Mitra πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 140 KB

There is a sustained interest in improving the computational performance of the sparse simplex (SSX) method for linear programs. Although there have been some investigations covering SSX on parallel computing platforms the performance results have not been particularly encouraging. While it is possi

Parallel realizations of Kanerva's spars
Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer
✍ HΓ€mΓ€lΓ€inen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 311 KB πŸ‘ 3 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation

Conjugate Gradient and Lanczos Methods f
Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors
✍ A. Basermann πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 312 KB

Conjugate gradient methods for solving sparse systems of linear equations and Lanczos algorithms for sparse symmetric eigenvalue problems play an important role in numerical methods for solving discretized partial differential equations. When these iterative solvers are parallelized on a multiproces