272 search results - page 42 / 55 » Parallel Reinforcement Learning with Linear Function Approxi... |
MLG
2007
Springer
15 years 5 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
105
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
ICANN
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. An abstract recurrent neural network trained by an unsupervised method is applied to the kinematic control of a robot arm. The network is a novel extension of the Neural ...
112
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
109
click to vote
ICML
2006
IEEE
16 years 16 days ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...