W.S.Stornetta, B.A.Huberman. An improved three-layer, back propagation algorithm. In M.Caudill, C.Butler (eds.), IEEE 1 s t ICNN, pp 637-643, San Diego, California, 6 1987. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Connectionist Unification with a distributed Representation - Weber (1992) (4 citations) (Correct)
....It is also be decoded by a hashing function. The local coding for constants and distributed representations for terms is depicted in fig.1. The components of the coding are shifted to the range [ Gamma0:5; 0:5] cause bp converges much faster if the activations are equal distributed arround 0. 0 [29]. Time consumption on encoding can be speeded up. Circular convolution needs O(n 2 ) time if we use it in the time domain. By the Fourier Transformation we can transform it to frequence domain where O(n) time is needed. The time for transformation is O(n log n) fig.2) Moreover, it is not ....
W.S.Stornetta, B.A.Huberman. An improved three-layer, back propagation algorithm. In M.Caudill, C.Butler (eds.), IEEE 1 s t ICNN, pp 637-643, San Diego, California, 6 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC