Analysis for a class of winner-take-all model

Authors:
J. P.F. Sum;Chi-Sing Leung;P. K.S. Tam;G. H. Young;W. K. Kan;Lai-Wan Chan
Affiliations:
Dept. of Comput. Sci., Hong Kong Baptist Univ., Kowloon;-;-;-;-;-
Venue:
IEEE Transactions on Neural Networks
Year:
1999

Citing 0
Cited 7

Clustering: A neural network approach

Neural Networks
Time-oriented synthesis for a WTA continuous-time neural network affected by capacitive cross-coupling

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Analysis and design of a k-winners-take-all model with a single state variable and the heaviside step activation function

IEEE Transactions on Neural Networks
Lagrange programming neural networks for compressive sampling

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
Parametric sensitivity and scalability of k-winners-take-all networks with a single state variable and infinity-gain activation functions

ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
Analog neural network approach for source localization using time-of-arrival measurements

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
Recurrent networks for compressive sampling

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tam et al. (1996) proposed a simple circuit of winner-take-all (WTA) neural network. Assuming no external input, they derived an analytic equation for its network response time. In this paper, we further analyze the network response time for a class of winner-take-all circuits involving self-decay and show that the network response time of such a class of WTA is the same as that of the simple WTA model