Sciweavers

1772 search results - page 98 / 355
» Classifying Problems into Complexity Classes
Sort
View
115
Voted
COLT
2006
Springer
15 years 6 months ago
Discriminative Learning Can Succeed Where Generative Learning Fails
Generative algorithms for learning classifiers use training data to separately estimate a probability model for each class. New items are classified by comparing their probabiliti...
Philip M. Long, Rocco A. Servedio
165
Voted
CSL
2007
Springer
15 years 8 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
121
Voted
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 6 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
148
Voted
AVBPA
2003
Springer
133views Biometrics» more  AVBPA 2003»
15 years 6 months ago
LUT-Based Adaboost for Gender Classification
There are two main approaches to the problem of gender classification, Support Vector Machines (SVMs) and Adaboost learning methods, of which SVMs are better in correct rate but ar...
Bo Wu, Haizhou Ai, Chang Huang
128
Voted
IJCAI
2001
15 years 4 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen