Abstract
A nearly cost-optimal winner-take-all (WTA) neural network derived from a constant-time sorting network is presented. The resultant WTA network has connection complexity [formula omitted] where s is the depth of cascaded sorting networks. Application of the WTA network to other problems such as nonbinary majority is also included.
Original language | English |
---|---|
Pages (from-to) | 601-604 |
Number of pages | 4 |
Journal | IEEE Transactions on Computers |
Volume | 44 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1995 Apr |
Externally published | Yes |
Keywords
- Quadratic perceptron
- complexity
- nonbinary majority
- sorting
- winner-take-all
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics