From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Geometric Heuristics for Transfer Learning in Decision Trees.

S. Chaubal, M. Rzepecki, P. Nicholson, G. Piao, и A. Sala. CIKM, стр. 151-160. ACM, (2021)

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.

New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity.S. Chaubal, и A. Gál. FSTTCS, том 122 из LIPIcs, стр. 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Geometric Heuristics for Transfer Learning in Decision Trees.S. Chaubal, M. Rzepecki, P. Nicholson, G. Piao, и A. Sala. CIKM, стр. 151-160. ACM, (2021)Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions.S. Chaubal, и A. Gál. LATIN, том 12118 из Lecture Notes in Computer Science, стр. 323-335. Springer, (2020)Tight bounds on sensitivity and block sensitivity of some classes of transitive functions.S. Chaubal, и A. Gál. Theor. Comput. Sci., (февраля 2023)Diameter Versus Certificate Complexity of Boolean Functions.S. Chaubal, и A. Gál. MFCS, том 202 из LIPIcs, стр. 31:1-31:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)How to Travel between Languages.K. Chatterjee, S. Chaubal, и S. Rubin. LATA, том 7810 из Lecture Notes in Computer Science, стр. 214-225. Springer, (2013)Faster Algorithms for Alternating Refinement Relations.K. Chatterjee, S. Chaubal, и P. Kamath. CSL, том 16 из LIPIcs, стр. 167-182. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)