( en | de | ru )

 

Disambiguation of "Takimoto, Eiji"

Author of the publication

copydeleteadd this publication to your clipboard
Smooth Boosting for Margin-Based Ranking.

, , , and . ALT, volume 5254 of Lecture Notes in Computer Science, page 227-239. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eiji Hisamatsu

Eiji Habuto

Eiji Takahashi

Eiji Kouno

Eiji Kudo

 

Other publications of authors with the same name

Recognition of Japanese Historical Hand-Written Characters Based on Object Detection Methods., , and . HIP@ICDAR, page 72-77. ACM, (2019)On-Line Estimation of Hidden Markov Model Parameters., , , , , and . Discovery Science, volume 1967 of Lecture Notes in Computer Science, page 155-169. Springer, (2000)Online Prediction under Submodular Constraints., , , , and . ALT, volume 7568 of Lecture Notes in Computer Science, page 260-274. Springer, (2012)Online Linear Optimization for Job Scheduling Under Precedence Constraints., , , and . ALT, volume 9355 of Lecture Notes in Computer Science, page 332-346. Springer, (2015)Editors' Introduction., , and . ALT, volume 4754 of Lecture Notes in Computer Science, page 1-8. Springer, (2007)Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices., , and . IEICE Trans. Inf. Syst., 101-D (8): 1997-2004 (2018)Simplified and unified analysis of various learning problems by reduction to Multiple-Instance Learning., and . UAI, volume 180 of Proceedings of Machine Learning Research, page 1896-1906. PMLR, (2022)Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme., , and . Theor. Comput. Sci., 261 (1): 179-209 (2001)Advanced Learning Schemes for Metaverse Applications in B5G/6G Networks., , , and . MetaCom, page 799-804. IEEE, (2023)Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes., and . CATS, volume 94 of CRPIT, page 89-98. Australian Computer Society, (2009)