Sciweavers

1859 search results - page 96 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
AAAI
2000
15 years 6 months ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar
ACL
2012
13 years 7 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
ICASSP
2008
IEEE
15 years 11 months ago
Effective error prediction using decision tree for ASR grammar network in call system
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
Hongcui Wang, Tatsuya Kawahara
153
Voted
NIPS
2007
15 years 6 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
NIPS
1993
15 years 6 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson