Sciweavers

2103 search results - page 245 / 421
» Approximate Learning of Dynamic Models
Sort
View
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
16 years 8 days ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
CG
2008
Springer
15 years 8 months ago
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
Rémi Coulom
JMLR
2010
121views more  JMLR 2010»
15 years 1 months ago
Efficient Collapsed Gibbs Sampling for Latent Dirichlet Allocation
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
Han Xiao, Thomas Stibor
JCNS
2010
90views more  JCNS 2010»
15 years 1 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
IEEECIT
2009
IEEE
16 years 28 days ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi