NeuroCOLT

Neural Networks and Computational Learning Theory

 

About NeuroCOLT

Papers Archive

1994 1995
1996 1997
1998 1999
2000 2001

Books

info@neurocolt.org

NeuroCOLT Technical Reports 1999

1999-034
On the sample complexity for nonoverlapping neural networks
Schmitt

1999-035
Sample-efficient Strategies for Learning in the Presence of Noise
Cesa-Bianchi,
Dichterman, Fischer,
Shamir & Simon

1999-036
Spatial and Temporal Pattern Analysis via Spiking Neurons
Natschläger & Ruf

1999-037
Noisy Spiking Neurons with Temporal Coding have more Computational Power than Sigmoidal Neurons
Maass

1999-038
A Simple Model for Neural Computation  with Firing Rates and Firing Correlations
Maass

1999-039
Dynamic Stochastic Synapses as  Computational Units
Maass & Zador

1999-040
On the Complexity of Learning for Spiking Neurons with Temporal Coding
Maass & Schmitt

1999-041
Computing and learning with spiking neurons
Maass & Zador

1999-042
Characterization of the relations in Grzegorczyk's Hierarchy revisited
Gakwaya

1999-043
Analysis of Two Gradient-based Algorithms for On-line Regression
Cesa-Bianchi

1999-044
Query languages for semi-algebraic databases based on descriptive complexity over
Meer

1999-045
A model for fast analogue computation based on unreliable synapses
Maass & Natschläger

1999-046
Cross-validation for binary classification by real-valued functions: theoretical analysis
Anthony & Holden

1999-047
Dependencies of composite connections in Field Programmable Neural Arrays
Girau

1999-048
On the Computational Power of Winner-Take-All
Maass

1999-049
Neural Systems as Nonlinear Filters
Maass & Sontag

1999-050
Efficient Computation in Networks of Spiking Neurons - Simulations and Theory
Natschläger

1999-051
Margin error and generalization capabilities of multi-class discriminant systems
Elisseeff, Guermeur
& Paugam-Moisy

1999-052
The Turing Closure of an Archimedean Field
Boldi & Vigna

1999-053
The consistency dimension and distribution-dependent learning from queries
Balcàzar, Castro, Guijarro & Simon

1999-054
Finding Relevant Variables in PAC Model with Membership Queries
Guijarro, Tarui & Tsukiji

1999-055
Sample Based Generalization Bounds
Williamson, Shawe-Taylor,
Schölkopf & Smola

1999-056
Large Margin Classification
Shawe-Taylor & Williamson

1999-057
A sharp concentration inequality with applications
Boucheron, Lugosi,  & Massart

1999-058
Worst-case bounds for the logarithmic loss of predictors
Cesa-Bianchi & Lugosi