Sciweavers

7978 search results - page 27 / 1596
» Combining shared-coin algorithms
Sort
View
ICPR
2006
IEEE
16 years 10 days ago
A 'No Panacea Theorem' for Multiple Classifier Combination
We introduce the `No Panacea Theorem' for classifier combination in the two-classifier, two-class case. It states that if the combination function is continuous and diverse, ...
Robert I. Damper, Roland Hu
IJIT
2004
15 years 18 days ago
Combining ILP with Semi-supervised Learning for Web Page Categorization
This paper presents a semi-supervised learning algorithm called Iterative-Cross Training (ICT) to solve the Web pages classification problems. We apply Inductive logic programming ...
Nuanwan Soonthornphisaj, Boonserm Kijsirikul
CVPR
2011
IEEE
14 years 3 months ago
TaylorBoost: First and Second-order Boosting Algorithms with Explicit Margin Control
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
Mohammad Saberian, Hamed Masnadi-Shirazi, Nuno Vas...
JCPHY
2011
87views more  JCPHY 2011»
14 years 2 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
ICML
2007
IEEE
16 years 1 days ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver