Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]
Author:
Keyword(s):
Year:  Vol:  Page: 


Receive this page by email each issue: [Sign up for eTOCs]

Cover Caption
Other Issues:
February 2002; 14 (2)   [Index by Author] 
       Articles
       Notes
       Letters
Find articles in this issue containing these words:
[Search ALL Issues]


To see an article, click its [Full Text] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.

Articles:

Michael Schmitt
On the Complexity of Computing and Learning with Multiplicative Neural Networks
Neural Comp. 2002 14: 241-301. [Abstract] [Full Text] [PDF]  

Notes:

Chuangyin Dang and Lei Xu
A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem
Neural Comp. 2002 14: 303-324. [Abstract] [Full Text] [PDF]  

Emery N. Brown, Riccardo Barbieri, Valérie Ventura, Robert E. Kass, and Loren M. Frank
The Time-Rescaling Theorem and Its Application to Neural Spike Train Data Analysis
Neural Comp. 2002 14: 325-346. [Abstract] [Full Text] [PDF]  

Letters:

Amit Manwani, Peter N. Steinmetz, and Christof Koch
The Impact of Spike Timing Variability on the Signal-Encoding Performance of Neural Spiking Models
Neural Comp. 2002 14: 347-367. [Abstract] [Full Text] [PDF]  

Carsten Meyer and Carl van Vreeswijk
Temporal Correlations in Stochastic Networks of Spiking Neurons
Neural Comp. 2002 14: 369-404. [Abstract] [Full Text] [PDF]  

Michele Bezzi, Inés Samengo, Stefan Leutgeb, and Sheri J. Mizumori
Measuring Information Spatial Densities
Neural Comp. 2002 14: 405-420. [Abstract] [Full Text] [PDF]  

Magnus Rattray
Stochastic Trapping in a Solvable Model of On-Line Independent Component Analysis
Neural Comp. 2002 14: 421-435. [Abstract] [Full Text] [PDF]  

Alessio Plebe and Angelo Marcello Anile
A Neural-Network-Based Approach to the Double Traveling Salesman Problem
Neural Comp. 2002 14: 437-471. [Abstract] [Full Text] [PDF]  

To see an article, click its [Full Text] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2002 by The MIT Press.