17329 search results - page 3183 / 3466 » Improved non-approximability results |
167
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
149
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
173
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper addresses the problem of classification in situations where the data distribution is not homogeneous: Data instances might come from different locations or times, and t...
177
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
211
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...