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

Implementations of artificial neural networks on the Connection Machine

โœ Scribed by Alexander Singer

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
785 KB
Volume
14
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Modeling Semantic Networks on the Connec
Modeling Semantic Networks on the Connection Machine
โœ S.H. Chung; D.I. Moldovan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1007 KB

Massively parallel architectures such as the Connection Machine can process large knowledge bases efficiently. An appropriate knowledge representation scheme for parallel processing is a semantic network. We have defined and implemented software data structures, marker propagation rules, and an inst

Issues on representational capabilities
Issues on representational capabilities of artificial neural networks and their implementation
โœ Mohammad Bahrami ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 543 KB

This work is an organized review on the representational capabilities of artificial neural networks and the questions that arise in their implementation. It covers the Kolmogorov's superposition theorem and different statements regarding how it could be related to the representational power of neura

Bounds on the complexity of recurrent ne
Bounds on the complexity of recurrent neural network implementations of finite state machines
โœ Bill G. Horne; Don R. Hush ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 823 KB

In this paper the efficiency of recurrent neural network implementations of m-state finite state machines will be explored. Specifically, it will be shown that the node complexity for the unrestricted case can be bounded above by O(v/-m-). It will also be shown that the node complexity is 0( ~) when