Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Issues

Volume 4, Issue 2
March 1992
Issue Cover
All Issues
ISSN 0899-7667
EISSN 1530-888X
In this Issue

Review

First- and Second-Order Methods for Learning: Between Steepest Descent and Newton's Method
Roberto Battiti
Neural Computation (1992) 4 (2): 141–166.
View articletitled, First- and Second-Order Methods for Learning: Between Steepest Descent and Newton's Method
Open the PDF for in another window

Article

Efficient Simplex-Like Methods for Equilibria of Nonsymmetric Analog Networks
Douglas A. Miller, Steven W. Zucker
Neural Computation (1992) 4 (2): 167–190.
View articletitled, Efficient Simplex-Like Methods for Equilibria of Nonsymmetric Analog Networks
Open the PDF for in another window

Note

A Volatility Measure for Annealing in Feedback Neural Networks
Joshua Alspector, Torsten Zeppenfeld, Stephan Luna
Neural Computation (1992) 4 (2): 191–195.
View articletitled, A Volatility Measure for Annealing in Feedback Neural Networks
Open the PDF for in another window

Letters

What Does the Retina Know about Natural Scenes?
Joseph J. Atick, A. Norman Redlich
Neural Computation (1992) 4 (2): 196–210.
View articletitled, What Does the Retina Know about Natural Scenes?
Open the PDF for in another window
A Simple Network Showing Burst Synchronization without Frequency Locking
Christof Koch, Heinz Schuster
Neural Computation (1992) 4 (2): 211–223.
View articletitled, A Simple Network Showing Burst Synchronization without Frequency Locking
Open the PDF for in another window
On a Magnitude Preserving Iterative MAXnet Algorithm
Bruce W. Suter, Matthew Kabrisky
Neural Computation (1992) 4 (2): 224–233.
View articletitled, On a Magnitude Preserving Iterative MAXnet Algorithm
Open the PDF for in another window
Learning Complex, Extended Sequences Using the Principle of History Compression
Jürgen Schmidhuber
Neural Computation (1992) 4 (2): 234–242.
View articletitled, Learning Complex, Extended Sequences Using the Principle of History Compression
Open the PDF for in another window
A Fixed Size Storage O(n3) Time Complexity Learning Algorithm for Fully Recurrent Continually Running Networks
Jürgen Schmidhuber
Neural Computation (1992) 4 (2): 243–248.
View articletitled, A Fixed Size Storage <em>O</em>(<em>n</em><sup>3</sup>) Time Complexity Learning Algorithm for Fully Recurrent Continually Running Networks
Open the PDF for in another window
How Tight Are the Vapnik-Chervonenkis Bounds?
David Cohn, Gerald Tesauro
Neural Computation (1992) 4 (2): 249–269.
View articletitled, How Tight Are the Vapnik-Chervonenkis Bounds?
Open the PDF for in another window
Working Memory Networks for Learning Temporal Order with Application to Three-Dimensional Visual Object Recognition
Gary Bradski, Gail A. Carpenter, Stephen Grossberg
Neural Computation (1992) 4 (2): 270–286.
View articletitled, Working Memory Networks for Learning Temporal Order with Application to Three-Dimensional Visual Object Recognition
Open the PDF for in another window

Product(s) added to cart

Go to Cart Continue Browsing
Close Modal

Advertisement

Advertisement

  • Online ISSN 1530-888X
  • Print ISSN 0899-7667
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2024 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept