From post

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

Static optimality and dynamic search-optimality in lists and trees.

A. Blum, S. Chawla, и A. Kalai. SODA, стр. 1-8. ACM/SIAM, (2002)

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.

Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract).A. Blum. COLT, стр. 393. Morgan Kaufmann, (1990)A Random-Surfer Web-Graph Model.A. Blum, T. Chan, и M. Rwebangira. ANALCO, стр. 238-246. SIAM, (2006)Mechanism Design via Machine Learning (short version)A. Blum, M. Balcan, J. Hartline, и Y. Mansour. Proceedings of the 46th Foundations of Computer Science (FOCS 2005), стр. unknown. (2003)Online algorithms for market clearing.A. Blum, T. Sandholm, и M. Zinkevich. SODA, стр. 971-980. ACM/SIAM, (2002)Rank-r Decision Trees are a Subclass of r-Decision Lists.A. Blum. Inf. Process. Lett., 42 (4): 183-185 (1992)New Approximation Algorithms for Graph Coloring.A. Blum. J. ACM, 41 (3): 470-516 (1994)Clustering with Interactive Feedback.M. Balcan, и A. Blum. ALT, том 5254 из Lecture Notes in Computer Science, стр. 316-328. Springer, (2008)PAC-MDL Bounds.A. Blum, и J. Langford. COLT, том 2777 из Lecture Notes in Computer Science, стр. 344-357. Springer, (2003)Efficient Co-Training of Linear Separators under Weak Dependence.A. Blum, и Y. Mansour. COLT, том 65 из Proceedings of Machine Learning Research, стр. 302-318. PMLR, (2017)Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds.A. Blum, D. Song, и S. Venkataraman. RAID, том 3224 из Lecture Notes in Computer Science, стр. 258-277. Springer, (2004)