default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"K-winners-take-all circuit with O(N) complexity."

Kiichi Urahama, Takeshi Nagao (1995)

> Home

Details and statistics

DOI: 10.1109/72.377986

access: closed

type: Journal Article

metadata version: 2020-05-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tnn/UrahamaN95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tnn/UrahamaN95
Kiichi Urahama, Takeshi Nagao:
K-winners-take-all circuit with O(N) complexity. IEEE Trans. Neural Networks 6(3): 776-778 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.