126 search results - page 12 / 26 » nips 2001 |
103
click to vote
NIPS
2001
14 years 11 months ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
NIPS
2001
14 years 11 months ago
2001
In the `missing data' approach to improving the robustness of automatic speech recognition to added noise, an initial process identifies spectraltemporal regions which are do...
NIPS
2001
14 years 11 months ago
2001
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
NIPS
2001
14 years 11 months ago
2001
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
NIPS
2001
14 years 11 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...