Author of the publication

Approximation Algorithms for Minimizing Average Distortion.

, , and . Theory Comput. Syst., 39 (1): 93-111 (2006)

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

Approximation Algorithms for Minimizing Average Distortion., , and . Theory Comput. Syst., 39 (1): 93-111 (2006)How Important is a Neuron., , and . ICLR (Poster), OpenReview.net, (2019)How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems., , , and . FOCS, page 367-378. IEEE Computer Society, (2005)Did the Model Understand the Question?, , , and . ACL (1), page 1896-1906. Association for Computational Linguistics, (2018)Approximating Additive Distortion of Embeddings into Line Metrics.. APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 96-104. Springer, (2004)The Shapley Taylor Interaction Index., , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 9259-9268. PMLR, (2020)Finding (Recently) Frequent Items in Distributed Data Streams., , , and . ICDE, page 767-778. IEEE Computer Society, (2005)WIC: A General-Purpose Algorithm for Monitoring Web Information Sources., , and . VLDB, page 360-371. Morgan Kaufmann, (2004)Non-clairvoyant Scheduling for Minimizing Mean Slowdown., , , and . STACS, volume 2607 of Lecture Notes in Computer Science, page 260-270. Springer, (2003)Approximation Algorithms for Minimizing Average Distortion., , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 234-245. Springer, (2004)