Sciweavers

329 search results - page 6 / 66
» Probably Approximately Correct Learning
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
13 years 12 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
WSC
2008
13 years 9 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
ICMLA
2007
13 years 9 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström
ICCV
2005
IEEE
14 years 1 months ago
Learning the Probability of Correspondences without Ground Truth
We present a quality assessment procedure for correspondence estimation based on geometric coherence rather than ground truth. The procedure can be used for performance evaluation...
Qingxiong Yang, R. Matt Steele, David Nisté...
GLOBECOM
2007
IEEE
14 years 1 months ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson