@article{8de9865e75f141538491c2d7b7ce7df0,
title = "On a Constant-Time, Low-Complexity Winner-Take-All Neural Network",
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.",
keywords = "complexity, nonbinary majority, Quadratic perceptron, sorting, winner-take-all",
author = "Tseng, {Yuen Hsien} and Wu, {Ja Ling}",
note = "Funding Information: We wish to thank Prof. Sartaj Sahni for suggesting this problem and the anonymous referee who suggested an alternate way of merging local segments (Section IV.C), that resulted in an improvement of a O(log”*n) factor. The research of Ramakrishna Thurimella was supported in part by National Science Foundation grant CCR-",
year = "1995",
month = apr,
doi = "10.1109/12.376175",
language = "English",
volume = "44",
pages = "601--604",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "4",
}