Results 231 to 240 of about 330,663 (269)
Some of the next articles are maybe not open access.
To Boost or Not to Boost Residents and Fellows—That Is the Question
Journal of Graduate Medical Education, 2022Sofia Zavala +2 more
openaire +2 more sources
2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), 2005
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed ...
openaire +1 more source
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed ...
openaire +1 more source
To Boost or Not to Boost? That is the Question
SSRN Electronic Journal, 2023Ye Lu, Adrian Pagan
openaire +1 more source
American Journal of Orthodontics and Dentofacial Orthopedics
Thijs Becker +4 more
openaire +2 more sources
Thijs Becker +4 more
openaire +2 more sources
Cancer Radiotherapie: Journal De La Societe Francaise De Radiotherapie Oncologique, 2021
Guillaume Peyraga +2 more
exaly
Guillaume Peyraga +2 more
exaly
Boosting productivity with the Boost Graph Library
XRDS: Crossroads, The ACM Magazine for Students, 2011openaire +1 more source
2008 19th International Conference on Pattern Recognition, 2008
Yan Jiang, Xiaoqing Ding
openaire +1 more source
Yan Jiang, Xiaoqing Ding
openaire +1 more source

