K-Winners-Rake-All Neural Net With T(1) Time Complexity  

Oleh:

Hsu, Tsong-Chih ; Wang, Sheng-De

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 8 no. 6 (1997), page 1557-1560.
Topik: neural network; k - winners - take - all; neural net; time complexity

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.2 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

In this article we present a k - winners - take - all (k - WTA) neural net that is established based on the concept of the constant time sorting machine by Hsu and Wang. It fits some specific applications, such as real - time processing, since its T(1) time complexity is independent to the problem size. The proposed k - WTA neural net produces the solution in constant time while the Hopfield network requires a relatively long transient to converge to the solution from some initial states.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali