Sciweavers

378 search results - page 16 / 76
» Grid based variational approximations
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
15 years 10 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
IJAR
2008
167views more  IJAR 2008»
14 years 9 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
ICIP
2005
IEEE
15 years 11 months ago
Real time facial expression recognition from image sequences using support vector machines
In this paper, two novel real-time methods are proposed for facial expression recognition in image sequences. The user manually places some of the Candide grid's points to th...
Irene Kotsia, Ioannis Pitas
102
Voted
ICML
2006
IEEE
15 years 10 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ICML
2000
IEEE
15 years 10 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos