Sciweavers

509 search results - page 24 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
ESSMAC
2003
Springer
14 years 19 days ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
ACCV
2007
Springer
14 years 1 months ago
Learning a Fast Emulator of a Binary Decision Process
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
Jan Sochman, Jiri Matas
UAI
1998
13 years 8 months ago
Learning the Structure of Dynamic Probabilistic Networks
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
Nir Friedman, Kevin P. Murphy, Stuart J. Russell
SAB
2010
Springer
226views Optimization» more  SAB 2010»
13 years 5 months ago
Distributed Online Learning of Central Pattern Generators in Modular Robots
Abstract. In this paper we study distributed online learning of locomotion gaits for modular robots. The learning is based on a stochastic approximation method, SPSA, which optimiz...
David Johan Christensen, Alexander Spröwitz, ...
ICML
2005
IEEE
14 years 8 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard