458 search results - page 47 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...