Published 1989
| Published
Book Section - Chapter
Open
On the K-Winners-Take-All Network
- Creators
- Majani, E.
- Erlanson, R.
- Abu-Mostafa, Y.
- Other:
- Touretzky, David S.
Abstract
We present and rigorously analyze a generalization of the Winner-Take-All Network: the K-Winners-Take-All Network. This network identifies the K largest of a set of N real numbers. The network model used is the continuous Hopfield model.
Additional Information
© 1989 Morgan Kaufmann. The authors would like to thank John Hopfield and Stephen DeWeerth from the California Institute of Technology and Marvin Perlman from the Jet Propulsion Laboratory for insightful discussions about material presented in this paper. Part of the research described in this paper was performed at the Jet Propulsion Laboratory under contract with NASA.Attached Files
Published - 157-on-the-k-winners-take-all-network.pdf
Files
157-on-the-k-winners-take-all-network.pdf
Files
(1.4 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:30405979f10cd3bd8f92f132ce69676c
|
1.4 MB | Preview Download |
Additional details
- Eprint ID
- 63471
- Resolver ID
- CaltechAUTHORS:20160107-160213913
- NASA/JPL
- Created
-
2016-01-14Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Series Name
- Advances in Neural Information Processing Systems
- Series Volume or Issue Number
- 1