836 search results - page 71 / 168 » On the Complexity of Train Assignment Problems |
137
click to vote
JCP
2007
15 years 3 months ago
2007
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
132
click to vote
TNN
1998
15 years 3 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
194
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We present several modifications of the original recurrent neural network language model (RNN LM). While this model has been shown to significantly outperform many competitive l...
137
Voted
PCM
2001
Springer
15 years 8 months ago
2001
Springer
The paper describes an experimental study on the detection of emotion from speech. As computer based characters such as avatars and virtual chat faces become more common, the use ...
112
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...