{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:34:25Z","timestamp":1648848865094},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T00:00:00Z","timestamp":1099267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Processing Letters"],"published-print":{"date-parts":[[2004,11]]},"DOI":"10.1007\/s11063-004-2016-6","type":"journal-article","created":{"date-parts":[[2004,11,27]],"date-time":"2004-11-27T04:32:49Z","timestamp":1101529969000},"page":"179-197","source":"Crossref","is-referenced-by-count":0,"title":["Recurrent Algorithms for Selecting the Maximum Input"],"prefix":"10.1007","volume":"20","author":[{"given":"Konstantinos","family":"Koutroumbas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0020-0190(93)90042-8","volume":"45","author":"W. T. Chen","year":"1993","unstructured":"Chen, W. T. and Hsieh, K. R.: A neural sorting network with O (1)complexity, Inform.Process.Lett. 45 (6)(1993), 309-313.","journal-title":"Inform. Process. Lett."},{"key":"CR2","first-page":"211","volume":"18","author":"C-M. Chen","year":"2002","unstructured":"Chen, C-M., Hsu, M-H. and Wang, T-Y.: A fast winner-take-all neural network with the dynamic ratio, J.Inform.Sci.and Eng., 18 (2002), 211-222.","journal-title":"J. Inform. Sci. and Eng."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Floreen, P.: The convergence of the Hamming memory networks, IEEE Trans.Neural Networks 2 (4)(1991).","DOI":"10.1109\/72.88164"},{"issue":"3","key":"CR4","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/72.286910","volume":"5","author":"K. Koutroumbas","year":"1994","unstructured":"Koutroumbas, K. and Kalouptsidis, N.: Qualitative analysis of the parallel and asynchro-nous modes of the Hamming network, IEEE Trans.Neural Networks 5 (3)(1994), 380-391.","journal-title":"IEEE Trans. Neural Networks"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00207169808804650","volume":"67","author":"K. Koutroumbas","year":"1998","unstructured":"Koutroumbas, K. and Kalouptsidis, N.: Neural networks architectures for selecting the maximum input, Int.J.Comput.Math., 67 (1998), 25-32.","journal-title":"Int. J. Comput. Math."},{"issue":"17","key":"CR6","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1049\/el:19921008","volume":"28","author":"H. K. Kwan","year":"1992","unstructured":"Kwan, H. K.: One-layer feedforward neural network for fast maximum\/minimum deter-mination, Electron.Lett., 28 (17)(1992), 1583-1585.","journal-title":"Electron. Lett."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0925-2312(96)00040-9","volume":"14","author":"S. S. Lin","year":"1996","unstructured":"Lin, S. S. and Hsu, S. H.: A low-cost neural sorting network with O (1)time complexity, Neurocomputing-Int.J. 14 (1996), 289-299.","journal-title":"Neurocomputing-Int. J."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Lippmann, R. P.: An introduction to computing with neural nets, IEEE ASSP Mag. 4 (2) (1987).","DOI":"10.1109\/MASSP.1987.1165576"},{"key":"CR9","unstructured":"Lippmann, R. P., Bold, B. and Malpass, M. L.: A comparison of Hamming and Hopfield neural nets for pattern classi cation, Technical report No 769, Lincoln Laboratory, MIT, May 1987."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/72.363428","volume":"6","author":"I. Melijson","year":"1995","unstructured":"Melijson, I., Ruppin, E. and Sipper, M.: A single-iteration threshold Hamming network, IEEE Trans.Neural Networks 6 (1995), 261-266.","journal-title":"IEEE Trans. Neural Networks"},{"issue":"4","key":"CR11","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/12.376175","volume":"44","author":"Y. H. Tseng","year":"1995","unstructured":"Tseng, Y. H. and Wu, J. L.: On a constant-time, low-complexity winner-take-all neural network, IEEE Trans.Comput., 44 (4)(1995), 601-604.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"CR12","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/72.377981","volume":"6","author":"O. Yadid-Pecht","year":"1995","unstructured":"Yadid-Pecht, O. and Gur, M.: A biologically-inspired improved Maxnet, IEEE Trans.Neural Networks 6 (3)(1995), 757-759.","journal-title":"IEEE Trans. Neural Networks"},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/72.363454","volume":"6","author":"J. F. Yang","year":"1995","unstructured":"Yang, J. F., Chen, C. M., Wang, W. C. and Lee, J. Y.: A general mean based iteration winner-take-all neural network, IEEE Trans.Neural Networks 6 (1)(1995), 14-24.","journal-title":"IEEE Trans. Neural Networks"},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/72.822521","volume":"11","author":"J. F. Yang","year":"2000","unstructured":"Yang, J. F. and Chen, C. M.: Winner-take-all neural networks using the highest thresh-old, IEEE Trans.Neural Networks 11 (1)(2000), 194-199.","journal-title":"IEEE Trans. Neural Networks"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Yen, J. C. and Chang, S.: Improved winner-take-all neural network, Electron.Lett., (1992), 662-664.","DOI":"10.1049\/el:19920419"},{"issue":"5","key":"CR16","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/72.317736","volume":"5","author":"J. C. Yen","year":"1994","unstructured":"Yen, J. C., Chang, F. J. and Chang, S.: A new winners-take-all architecture in artificial neural networks, IEEE Trans.Neural Networks 5 (5)(1994), 838-843.","journal-title":"IEEE Trans. Neural Networks"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-004-2016-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-004-2016-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-004-2016-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:22:54Z","timestamp":1559362974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-004-2016-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,11]]}},"alternative-id":["DO00002016"],"URL":"https:\/\/doi.org\/10.1007\/s11063-004-2016-6","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11]]}}}