ACM Home Page
Please provide us with feedback. Feedback
Computing with structured connectionist networks
Full text PdfPdf (1.93 MB)
Source
Communications of the ACM archive
Volume 31 ,  Issue 2  (February 1988) table of contents
Pages: 170 - 187  
Year of Publication: 1988
ISSN:0001-0782
Authors
Jerome A. Feldman  Univ. of Rochester, Rochester, NY
Mark A. Fanty  International Computer Science Institute, Berkeley, CA
Nigel H. Goddard  Hughes Aircraft Company, Calabasas, CA
Kenton J. Lynne  Univ. of Rochester, Rochester, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Citation Count: 11
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/42372.42378
What is a DOI?

ABSTRACT

The design and applications of massively parallel computational models could lead to dramatic advances in the ability to automate complex tasks such as those found in artificial intelligence.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Amari, S., and Arbib. M.A., Eds. Competition and Cooperation in Neural Nets. Lecture Notes in Biomathematics, vol. 45, S. Levin, Ed. Springer-Verlag, New York, 1982.
 
2
Bailey, J., and Hammerstrom, D. How to make a billion connections. Tech Rep. CS/E-86-007, Dept. of Computer Science and Engineering, Oregon Graduate Center, Portland, Oreg., 1986.
 
3
 
4
Ballard, D.H., Hinton, G.E., and Sejnowski, T.J. Parallel visual computation. Nature 306, 5938 (Nov. 3, 1983}, 21-26.
 
5
BBN Laboratories. Butterfly Parallel Processor Overview. BBN Laboratories, Cambridge, Mass., June 1985.
 
6
Blelloch, G.E. AFL-i: A programming language for massively concurrent computers. M.S. thesis, Dept. of Electrical Engineering and Computer Science, MIT, Cambridge, Mass., 1986.
 
7
Cohen, M.A., and Grossberg, S. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. Syst. Man Cybern. 13, 5 (1983), 815-.825.
 
8
Cooper, P.R., and Hollbach, S.C. Parallel recognition of objects comprised of pure structure. In Proceedings of the DARPA Image Understanding Workshop (Los Angeles, Calif., Feb.}. DARPA. Washington, D.C., 1987, pp. 381-391.
 
9
 
10
Cottrell, G.W. Connectionist parsing. In Proceedings of the 7th Annual Cognitive Science Society Conference (Irvine, Calif.). Cognitive Science Society, 1985.
 
11
 
12
Feldman, J.A. Dynamic connections in neural networks. Biol. Cybern. 46, 1 (1982), 27-39.
 
13
Feldman, }.A. Four frames suffice: A provisional model of vision and space. Behav. Brain Sci. 8, 2 (June 1985), 265-289.
 
14
Feldman, J.A. Neural representation of conceptual knowledge. Tech. Rep. 189, Computer Science Dept., Univ. of Rochester, Rochester, N.Y., June 1986.
 
15
Feldman, J.A., and Ballard, D.H. Connectionist models and their properties. Cognitive Sci. 6, 3 {1982}, 205-254.
 
16
Goddard, N.H., Fanty, M.A., and Lynne, K. The Rochester connectionist simulator. Tech. Rep. 233, Computer Science Dept., Univ. of Rochester, Rochester, N.Y., 1987.
 
17
Hillis, W.D., and Barnes, J. Programming a highly parallel computer. Nature 326, 6108 {Mar. 5, 1987), 27-30.
 
18
 
19
Hopfield, l.J., and Tank, D.W. Computing with neural circuits: A model. Science 233, 4764 (Aug, 8, 1986), 625-632.
 
20
 
21
Minsky, M., and Papert, S. Perceptrons. 2nd ed. MIT P:ress, Cambridge, Mass., 1972.
 
22
 
23
Palm, G. Associative networks and their information storage capacity. Cognitive Syst. 1, 2 {June 1985), 107-118.
 
24
Parker, D.B. Learning-logic. Tech. Rep. 47, Center for Computational Research in Economics and Management Science, MI'F, Cambridge, Mass., Apr. 1985.
 
25
Posner, M.{. Chronometric Exptorations of Mind. Erlbaurn, Hillsdale, N.J., 1978.
 
26
 
27
28
 
29
Sabbah, D. Computing with connections in visual recognilion of Origami objects. Cognitive Sci. 9, 1 (1985), 25-50.
 
30
 
31
Shastri, L.. and Feldman, J.A. Evidential reasoning in semantic networks: A formal theory. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (Los Angeles, Calif,, Aug. 18-23), 1985. pp. 465-474.
 
32
Small, S.L., Shastri. L., Brucks, M.L., Kau~man, S.G., Cottrell, G.W.. and Addanki, S. ISCON: A network construction aid and simulator for connectionist models. Tech Rep. 109. Computer Science Depl., Univ, of Rochester, Rochester, N.Y., Apr. 1983.
 
33
Sullins, J, Value cell encoding strategies. Tech. Rep, 165. Computer Science Dept., Univ. of Rochester, Rochester, N.Y., Aug, 1985.
 
34
Thompson. R.F. The neurobiology of learning and memory. Science 233, 4767 (Aug. 29, 1986), 941-947.
 
35
yon der Malsburg, C. Nervous structures with dynamical links. Ber. Bunsenges. Phys. Chem. 89, 1 (1985), 703-710.
 
36
Waltz, D.L., and Pollack, J.B. Massively parallel parsing. Cognitive Sci. 9 (1985), 51-74.
 
37

CITED BY  11


REVIEW

"Peter C. Patton : Reviewer"

This fascinating paper describes a research project to discover the algorithms that allow the brain to carry out vision, locomotion, and language understanding. The study of neural computation reveals that the brain can solve difficult problems   more...

Collaborative Colleagues:
Jerome A. Feldman: colleagues
Mark A. Fanty: colleagues
Nigel H. Goddard: colleagues
Kenton J. Lynne: colleagues