Neural computation with winner-take-all as the only nonlinear operation

Advances in Neural Information Processing Systems

Volumn , Issue , 2000, Pages 293-299

  Maass, Wolfgang ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

COMPUTATIONAL POWER; COMPUTATIONAL UNITS; CONTINUOUS FUNCTIONS; MULTI LAYER PERCEPTRON; NEURAL COMPUTATIONS; NONLINEAR OPERATION; TOTAL WIRE LENGTH; WINNER TAKE ALLS;

VLSI CIRCUITS;

EID: 84899020466     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Brown, T. X. (1991). Neural Network Design for Switching Network Control. Ph.-D.-Thesis, CALTECH.
2. Grossberg, S. (1973). Contour enhancement, short term memory, and constancies in reverberating neural networks. Studies in Applied Mathematics, vol. 52, 217-257.
3. Horiuchi, T. K., Morris, T. G., Koch, C, DeWeerth, S. P. (1997). Analog VLSI circuits for attention-based visual tracking. Advances in Neural Information Processing Systems, vol. 9, 706-712.
4. Indiveri, G. (1999). Modeling selective attention using a neuromorphic analog VLSI device, submitted for publication.
5. Lazzaro, J., Ryckebusch, S., Mahowald, M. A., Mead, C. A. (1989). Winner-take-all networks ofO(n) complexity. Advances in Neural Information Processing Systems, vol. 1, Morgan Kaufmann (San Mateo), 703-711.
6. Maass, W. (2000). On the computational power of winner-take-all, Neural Computation, in press.
7. Meador, J. L., and Hylander, P. D. (1994). Pulse coded winner-take-all networks. In: Silicon Implementation of Pulse Coded Neural Networks, Zaghloul, M. E., Meador, J., and Newcomb, R. W., eds., Kluwer Academic Publishers (Boston), 79-99.
8. Minsky, M. C, Papert, S. A. (1969). Perceptrons, MIT Press (Cambridge).
9. Siu, K.-Y., Roychowdhury, V, Kailath, T. (1995). Discrete Neural Computation: A Theoretical Foundation. Prentice Hall (Englewood Cliffs, NJ, USA).
10. Urahama, K., and Nagao, T. (1995). κ-winner-take-all circuit with O(N) complexity. IEEE Trans, on Neural Networks, vol.6, 776-778.