Sciweavers

2218 search results - page 361 / 444
» Bayesian Treed Models
Sort
View
ICWS
2004
IEEE
14 years 11 months ago
Dynamic Workflow Composition using Markov Decision Processes
The advent of Web services has made automated workflow composition relevant to Web based applications. One technique that has received some attention, for automatically composing ...
Prashant Doshi, Richard Goodwin, Rama Akkiraju, Ku...
NCI
2004
141views Neural Networks» more  NCI 2004»
14 years 11 months ago
Estimating the error at given test input points for linear regression
In model selection procedures in supervised learning, a model is usually chosen so that the expected test error over all possible test input points is minimized. On the other hand...
Masashi Sugiyama
AAAI
1996
14 years 11 months ago
Estimating the Absolute Position of a Mobile Robot Using Position Probability Grids
In order to re-use existing models of the environment mobile robots must be able to estimate their position and orientation in such models. Most of the existing methods for positi...
Wolfram Burgard, Dieter Fox, Daniel Hennig, Timo S...
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 10 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
JMLR
2006
118views more  JMLR 2006»
14 years 10 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng