|
NeuroCOLT Technical Reports 2001
2001-117
Spiking Neurons and the Induction of
Finite State Machines
Thomas Natschläger and Wolfgang Maass
2001-116
Optimizing the Layout of a Balanced Tree
Robert Legenstein and Wolfgang Maass
2001-115
Neural Circuits for Pattern Recognition
with Small Total Wire Length
Robert Legenstein and Wolfgang Maass
2001-114
Total Wire Length as a Salient Circuit
Complexity Measure for Sensory Processing
Robert Legenstein and Wolfgang Maass
2001-113
Real-time Computing without Stable States:
A New Framework for Neural Computation Based on Perturbations
Wolfgang Maass, Thomas Natschläger and Henry Markram
2001-112
A Robust Implementation of Autonomous
Learning in a Mobile Robot
Wolfgang Maass, Gerald Steinbauer and Roland Koholka
2001-111
Universal Learning with Parallel Perceptrons
Peter Auer, Harald Burgsteiner and Wolfgang Maass
2001-110
Computing the Optimally Fitted Spike
Train for a Synapse
Thomas Natschläger and Wolfgang Maass
2001-109
Neural Computation: A Research Topic
for Theoretical Computer Science? Some Thoughts and Pointers
Wolfgang Maass
2001-108
Finding the Key to a Synapse
Thomas Natschläger and Wolfgang Maass
2001-107
Synapses as Dynamic Memory Buffers
Wolfgang Maass and Henry Markram
2001-106
Potential-based Algorithms in On-line
Prediction and Game Theory
Nicolo Cesa-Bianchi and Gabor Lugosi
2001-105
Radial Basis Function Neural Networks
have Superlinear VC Dimension
Michael Schmitt
2001-104
On the Complexity of Computing and
Learning with Multiplicative Neural Networks
Michael Schmitt
2001-103
Product Unit Neural Networks with Constant
Depth and Superlinear VC Dimension
Michael Schmitt
2001-102
Complexity of Learning for Networks of Spiking
Neurons with Nonlinear Synaptic Interaction
Michael
Schmitt
2001-100
Spectral Kernel Methods for Clustering
Nello Cristianini, John Shawe-Taylor, Jaz Kandola
2001-099
On Kernel Target Alignment
Nello Cristianini, Andre Elisseeff, John Shawe-Taylor, Jaz Kandola
2001-098
On the Convergence of Leveraging
Gunnar Ratsch, Sebastian Mika, Manfred K. Warmuth
2001-097
Marginal Boosting
Gunnar Ratsch, Manfred K. Warmuth
2001-096
A new approximate maximal margin classification
algorithm
Claudio Gentile
2001-095
Delta Approximable
Functions
Meysonniet, Boldi, Vigna
2001-094
Estimating the Optimal
Margin of Embeddings in Euclidean Half Spaces
Forster, Schmidt,
Simon
2001-093
A Linear Lower Bound
on the Unbounded Error
Probabilistic Error Complexity
Forster
2001-092
Finding Frequent Itemsets With At Most
One Negated Attribute
I Fortes, JL Balcazar, R Morales
2001-091
Mining Unbounded Episodes from Sequential
Data
J Baixeries, G Casas-Garriga, JL Balcazar
2001-090
A New Abstract Combinatorial Dimension
for Exact Learning via Queries
I Fortes, JL Balcazar, R Morales
2001-089
Set Covering Machine
Mario Marchand, John Shawe-Taylor
2001-088
Limitations of Learning
via Embedding in Euclidean
Half Spaces
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
2001-087
On Optimizing Kernel Alignment
Nello Cristianini, Jaz Kandola, Andre Elisseeff, John Shawe-Taylor
TBA
|