On learning and computational complexity of FIR radial basis function networks. Part I. Learning of FIR RBFN's - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Kayvan Najarian. On learning and computational complexity of FIR radial basis function networks. Part I. Learning of FIR RBFN's. In IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2001, 7-11 May, 2001, Salt Palace Convention Center, Salt Lake City, Utah, USA, Proceedings. pages 1321-1324, IEEE, 2001. [doi]

The following publications are possibly variants of this publication:

On learning and computational complexity of FIR radial basis function networks. Part II. Complexity measuresKayvan Najarian. icassp 2001: 1325-1328 [doi]

FIR Volterra kernel neural models and PAC learningKayvan Najarian. complexity, 7(6):48-55, 2002. [doi]

runs on WebDSL