From post

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.

 

Другие публикации лиц с тем же именем

Better streaming algorithms for clustering problems., , и . STOC, стр. 30-39. ACM, (2003)Asymptotic Polynomial-Time Approximation Schemes., , и . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Truth revelation in approximately efficient combinatorial auctions., , и . EC, стр. 96-102. ACM, (1999)Sampling from a moving window over streaming data, , , и . Proceedings of PODS'03, стр. 234--243. (2003)Truth Revelation in Approximately Efficient Combinatorial Auctions, , и . CoRR, (2002)A k-Median Algorithm with Running Time Independent of Data Size., , и . Mach. Learn., 56 (1-3): 61-87 (2004)Representing Graph Metrics with Fewest Edges., , , , и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 355-366. Springer, (2003)Streaming-Data Algorithms for High-Quality Clustering., , , , и . ICDE, стр. 685-694. IEEE Computer Society, (2002)Computing Shortest Paths with Uncertainty., , , , и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 367-378. Springer, (2003)Approximation algorithms for clustering streams and large data sets.. Stanford University, USA, (2003)