Combining distributed and localist computations in real-time neural networks

Behavioral and Brain Sciences 23 (4):473-474 (2000)
  Copy   BIBTEX

Abstract

In order to benefit from the advantages of localist coding, neural models that feature winner-take-all representations at the top level of a network hierarchy must still solve the computational problems inherent in distributed representations at the lower levels.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
47 (#329,840)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations