( en | de | ru )

 

Disambiguation of "Golovin, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Hidden Technical Debt in Machine Learning Systems.

, , , , , , , , , and . NIPS, page 2503-2511. (2015)

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.

Mykola Golovin

Daniel

Daniel

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)

Daniel Wied

Zivilprozessuale Qualifikationsprobleme im Spannungsfeld von Vertrag und Delikt: ein Beitrag zur Auslegung nationalen Zivilprozessrechts in europäischer Perspektive. Uni Regensburg, (2009)
 

Other publications of authors with the same name

Randomized Sensing in Adversarial Environments., , and . IJCAI, page 2133-2139. IJCAI/AAAI, (2011)Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems., , and . STACS, volume 3884 of Lecture Notes in Computer Science, page 206-217. Springer, (2006)Uniquely Represented Data Structures for Computational Geometry., , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 17-28. Springer, (2008)A revealed preference approach to computational complexity in economics., , and . EC, page 101-110. ACM, (2011)Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization, and . (2010)cite arxiv:1003.3967Comment: 53 pages, 6 figures. Version 3 was a major revision, with an improved policy-centric exposition and much new material. Version 4 is a minor revision, mostly to elaborate on the proof of the min-cost cover results; see Theorem 37 and Lemma 38.Random Hypervolume Scalarizations for Provable Multi-Objective Black Box Optimization., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 11096-11105. PMLR, (2020)Strongly History-Independent Hashing with Applications., and . FOCS, page 272-282. IEEE Computer Society, (2007)Quorum placement in networks: minimizing network congestion., , , , and . PODC, page 16-25. ACM, (2006)Restart Schedules for Ensembles of Problem Instances., , and . AAAI, page 1204-1210. AAAI Press, (2007)Combining Multiple Heuristics Online., , and . AAAI, page 1197-1203. AAAI Press, (2007)