From post

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.

 

Другие публикации лиц с тем же именем

Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices., , и . IEICE Trans. Inf. Syst., 101-D (8): 1997-2004 (2018)Advanced Learning Schemes for Metaverse Applications in B5G/6G Networks., , , и . MetaCom, стр. 799-804. IEEE, (2023)Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme., , и . Theor. Comput. Sci., 261 (1): 179-209 (2001)Simplified and unified analysis of various learning problems by reduction to Multiple-Instance Learning., и . UAI, том 180 из Proceedings of Machine Learning Research, стр. 1896-1906. PMLR, (2022)Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes., и . CATS, том 94 из CRPIT, стр. 89-98. Australian Computer Society, (2009)Mutual Information Gaining Algorithm and Its Relation to PAC-Learning Algorithm., , и . AII/ALT, том 872 из Lecture Notes in Computer Science, стр. 547-559. Springer, (1994)Online Linear Optimization for Job Scheduling Under Precedence Constraints., , , и . ALT, том 9355 из Lecture Notes in Computer Science, стр. 332-346. Springer, (2015)Editors' Introduction., , и . ALT, том 4754 из Lecture Notes in Computer Science, стр. 1-8. Springer, (2007)Online Prediction under Submodular Constraints., , , , и . ALT, том 7568 из Lecture Notes in Computer Science, стр. 260-274. Springer, (2012)On-Line Estimation of Hidden Markov Model Parameters., , , , , и . Discovery Science, том 1967 из Lecture Notes in Computer Science, стр. 155-169. Springer, (2000)