329 search results - page 20 / 66 » Probably Approximately Correct Learning |
IJBC
2007
13 years 7 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
FGR
2000
IEEE
13 years 12 months ago
2000
IEEE
We present a method to learn models of human heads for the purpose of detection from different viewing angles. We focus on a model where objects are represented as constellations ...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
DSMML
2004
Springer
13 years 11 months ago
2004
Springer
We investigate theoretically some properties of variational Bayes approximations based on estimating the mixing coefficients of known densities. We show that, with probability 1 a...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...