Skip Nav Destination

Issues

Select Year

Issue

Volume 3, Issue 3

Fall 1991

Previous Issue
Next Issue

All Issues

ISSN 0899-7667

EISSN 1530-888X

In this Issue

View
Note
Letters

View

A Practical Approach for Representing Context and for Performing Word Sense Disambiguation Using Neural Networks

Stephen I. Gallant

Neural Computation (1991) 3 (3): 293–309.

Abstract

View articletitled, A Practical Approach for Representing Context and for Performing Word Sense Disambiguation Using Neural Networks

Open the PDF for in another window

Note

A Modified Quickprop Algorithm

Alistair Craig Veitch, Geoffrey Holmes

Neural Computation (1991) 3 (3): 310–311.

View articletitled, A Modified Quickprop Algorithm

Open the PDF for in another window

Letters

Removing Time Variation with the Anti-Hebbian Differential Synapse

Graeme Mitchison

Neural Computation (1991) 3 (3): 312–320.

Abstract

View articletitled, Removing Time Variation with the Anti-Hebbian Differential Synapse

Open the PDF for in another window

Simulations of a Reconstructed Cerebellar Purkinje Cell Based on Simplified Channel Kinetics

Paul C. Bush, Terrence J. Sejnowski

Neural Computation (1991) 3 (3): 321–332.

Abstract

View articletitled, Simulations of a Reconstructed Cerebellar Purkinje Cell Based on Simplified Channel Kinetics

Open the PDF for in another window

On the Mechanisms Underlying Directional Selectivity

H. Öğmen

Neural Computation (1991) 3 (3): 333–349.

Abstract

View articletitled, On the Mechanisms Underlying Directional Selectivity

Open the PDF for in another window

2-Degree-of-freedom Robot Path Planning using Cooperative Neural Fields

Michael Lemmon

Neural Computation (1991) 3 (3): 350–362.

Abstract

View articletitled, 2-Degree-of-freedom Robot Path Planning using Cooperative Neural Fields

Open the PDF for in another window

Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem

Martin W. Simmen

Neural Computation (1991) 3 (3): 363–374.

Abstract

View articletitled, Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem

Open the PDF for in another window

FIR and IIR Synapses, a New Neural Network Architecture for Time Series Modeling

A. D. Back, A. C. Tsoi

Neural Computation (1991) 3 (3): 375–385.

Abstract

View articletitled, FIR and IIR Synapses, a New Neural Network Architecture for Time Series Modeling

Open the PDF for in another window

The Transition to Perfect Generalization in Perceptrons

Eric B. Baum, Yuh-Dauh Lyuu

Neural Computation (1991) 3 (3): 386–401.

Abstract

View articletitled, The Transition to Perfect Generalization in Perceptrons

Open the PDF for in another window

Learning by Asymmetric Parallel Boltzmann Machines

Bruno Apolloni, Diego de Falco

Neural Computation (1991) 3 (3): 402–408.

Abstract

View articletitled, Learning by Asymmetric Parallel Boltzmann Machines

Open the PDF for in another window

Generalization Effects of k-Neighbor Interpolation Training

Takeshi Kawabata

Neural Computation (1991) 3 (3): 409–417.

Abstract

View articletitled, Generalization Effects of <em>k</em>-Neighbor Interpolation Training

Open the PDF for in another window

Including Hints in Training Neural Nets

Khalid A. Al-Mashouq, Irving S. Reed

Neural Computation (1991) 3 (3): 418–427.

Abstract

View articletitled, Including Hints in Training Neural Nets

Open the PDF for in another window

On the Characteristics of the Autoassociative Memory with Nonzero-Diagonal Terms in the Memory Matrix

Jung-Hua Wang, Thomas F. Krile, John F. Walkup, Tai-Lang Jong

Neural Computation (1991) 3 (3): 428–439.

Abstract

View articletitled, On the Characteristics of the Autoassociative Memory with Nonzero-Diagonal Terms in the Memory Matrix

Open the PDF for in another window

Handwritten Digit Recognition Using K Nearest-Neighbor, Radial-Basis Function, and Backpropagation Neural Networks

Yuchun Lee

Neural Computation (1991) 3 (3): 440–449.

Abstract

View articletitled, Handwritten Digit Recognition Using <em>K</em> Nearest-Neighbor, Radial-Basis Function, and Backpropagation Neural Networks

Open the PDF for in another window

A Matrix Method for Optimizing a Neural Network

Simon A. Barton

Neural Computation (1991) 3 (3): 450–459.

Abstract

View articletitled, A Matrix Method for Optimizing a Neural Network

Open the PDF for in another window

Product(s) added to cart

Go to Cart Continue Browsing

Email alerts

Latest Issue Alert

RSS Feeds

RSS Feed - Current Issue Only

Open Issues RSS Feed

View

A Practical Approach for Representing Context and for Performing Word Sense Disambiguation Using Neural Networks

Note

A Modified Quickprop Algorithm

Letters

Removing Time Variation with the Anti-Hebbian Differential Synapse

Simulations of a Reconstructed Cerebellar Purkinje Cell Based on Simplified Channel Kinetics

On the Mechanisms Underlying Directional Selectivity

2-Degree-of-freedom Robot Path Planning using Cooperative Neural Fields

Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem

FIR and IIR Synapses, a New Neural Network Architecture for Time Series Modeling

The Transition to Perfect Generalization in Perceptrons

Learning by Asymmetric Parallel Boltzmann Machines

Generalization Effects of k-Neighbor Interpolation Training

Including Hints in Training Neural Nets

On the Characteristics of the Autoassociative Memory with Nonzero-Diagonal Terms in the Memory Matrix

Handwritten Digit Recognition Using K Nearest-Neighbor, Radial-Basis Function, and Backpropagation Neural Networks

A Matrix Method for Optimizing a Neural Network

Email alerts

RSS Feeds

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

Issues

View

Note

Letters

Product(s) added to cart

Email alerts

RSS Feeds

A product of The MIT Press

MIT Press Direct

Information

MIT Press

Contact Us

This Feature Is Available To Subscribers Only