Pith. sign in

REVIEW

K-Winners-Take-All Computation with Neural Oscillators

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv q-bio/0401001 v1 pith:JYIQA2IK submitted 2003-12-31 q-bio.NC

K-Winners-Take-All Computation with Neural Oscillators

classification q-bio.NC
keywords computationk-winners-take-allneuraloscillatorsachievedadvantagesarbitraryarchitectures
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Artificial spike-based computation, inspired by models of computation in the central nervous system, may present significant performance advantages over traditional methods for specific types of large scale problems. This paper describes very simple network architectures for k-winners-take-all and soft-winner-take-all computation using neural oscillators. Fast convergence is achieved from arbitrary initial conditions, which makes the networks particularly suitable to track time-varying inputs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.