Author of the publication

Fast Noise Removal for k-Means Clustering.

, , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 456-466. PMLR, (2020)

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.

 

Other publications of authors with the same name

A tutorial on amortized local competitiveness in online scheduling, , and . SIGACT News, 42 (2): 83--97 (June 2011)Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , and . J. ACM, 65 (1): 3:1-3:33 (2018)Brief announcement: online batch scheduling for flow objectives., and . SPAA, page 102-104. ACM, (2013)Competitively scheduling tasks with intermediate parallelizability., , , and . SPAA, page 22-29. ACM, (2014)Unconditional Coresets for Regularized Loss Minimization., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 482-492. PMLR, (2020)Fast Noise Removal for k-Means Clustering., , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 456-466. PMLR, (2020)Competitive Analysis of Constrained Queueing Systems., , and . ICALP, volume 55 of LIPIcs, page 143:1-143:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Stochastic Scheduling of Heavy-tailed Jobs., , and . STACS, volume 30 of LIPIcs, page 474-486. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Non-clairvoyantly Scheduling to Minimize Convex Functions., , , and . Algorithmica, 81 (9): 3746-3764 (2019)Shortest-Elapsed-Time-First on a Multiprocessor., , , and . MedAlg, volume 7659 of Lecture Notes in Computer Science, page 82-92. Springer, (2012)