Publications

Found 4 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)
2004
Towards the next generation of enterprise search technology Broder, r.Z.; Ciccolo, A.C. , IBM Systems Journal, Volume 43, Number 3, p.451-454, (2004)
Copyright © 2009 Yahoo! Inc. All rights reserved.