Publications

Found 3 results

Filters: author is Arthur  [Clear All Filters]
2007
k-means++: The advantages of Careful Seeding Arthur, D.; Vassilvitskii, S. , Symposium on Discrete Algorithms, (2007)
2006
How slow is the k-means method? Arthur, D.; Vassilvitskii, S. , Symposium on Computational Geometry, (2006)
Worst-case and Smoothed Analyses of the ICP Algorithm, With an Application to the k-means Method Arthur, D.; Vassilvitskii, S. , Symposium on Foundations of Computer Science, (2006)