On a Constant-Time, Low-Complexity Winner-Take-All Neural Network

Yuen-Hsien Tseng, Ja Ling Wu

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)601-604
Number of pages4
JournalIEEE Transactions on Computers
Volume44
Issue number4
DOIs
Publication statusPublished - 1995 Jan 1

Fingerprint

Winner-take-all
Time Constant
Sorting
Sorting Networks
Low Complexity
Neural Networks
Neural networks
Costs

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

Cite this

On a Constant-Time, Low-Complexity Winner-Take-All Neural Network. / Tseng, Yuen-Hsien; Wu, Ja Ling.

In: IEEE Transactions on Computers, Vol. 44, No. 4, 01.01.1995, p. 601-604.

Research output: Contribution to journalArticle

@article{42223d041a2e455389e6410332b007d3,
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 = "Quadratic perceptron, complexity, nonbinary majority, sorting, winner-take-all",
author = "Yuen-Hsien Tseng and Wu, {Ja Ling}",
year = "1995",
month = "1",
day = "1",
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",

}

TY - JOUR

T1 - On a Constant-Time, Low-Complexity Winner-Take-All Neural Network

AU - Tseng, Yuen-Hsien

AU - Wu, Ja Ling

PY - 1995/1/1

Y1 - 1995/1/1

N2 - 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.

AB - 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.

KW - Quadratic perceptron

KW - complexity

KW - nonbinary majority

KW - sorting

KW - winner-take-all

UR - http://www.scopus.com/inward/record.url?scp=0029291227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029291227&partnerID=8YFLogxK

U2 - 10.1109/12.376175

DO - 10.1109/12.376175

M3 - Article

VL - 44

SP - 601

EP - 604

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 4

ER -