2022
DOI: 10.1109/jas.2022.105932
|View full text |Cite
|
Sign up to set email alerts
|

On RNN-Based $k$-WTA Models With Time-Dependent Inputs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Inspired by this phe-nomenon, an algorithm named WTA is proposed to pick the maxima from all the inputs. A more general form of WTA algorithm is called k-winner-tall-all (k-WTA) [7], [8], which selects k largest values from a group of inputs. As the WTA model is computationally powerful and can generate useful functions needed in many applications, many models have been proposed by researchers to produce the WTA competition.…”
mentioning
confidence: 99%
“…Inspired by this phe-nomenon, an algorithm named WTA is proposed to pick the maxima from all the inputs. A more general form of WTA algorithm is called k-winner-tall-all (k-WTA) [7], [8], which selects k largest values from a group of inputs. As the WTA model is computationally powerful and can generate useful functions needed in many applications, many models have been proposed by researchers to produce the WTA competition.…”
mentioning
confidence: 99%