4544 search results - page 356 / 909 » Reinforcement Learning with Time |
130
click to vote
PRICAI
2000
Springer
15 years 8 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
175
click to vote
NIPS
2004
15 years 5 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
135
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at appl...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
140
click to vote
IJHR
2008
15 years 4 months ago
2008
In this paper, we deal with imitation learning of arm movements in humanoid robots. Hidden Markov Models (HMM) are used to generalize movements demonstrated to a robot multiple tim...