Publications

Found 10 results

Filters: author is Vassilvitskii  [Clear All Filters]
2008
Optimal Envy-free Pricing with Metric Substitutability Chen, N.; Ghosh, A.; Vassilvitskii, S. , ACM Conference on Electronic Commerce (EC'08), (2008) Abstract
Relaxation in Text Search using Taxonomies Fontoura, M.; Josifovski, V.; Kumar, R.; Olston, C.; Tomkins, A.; Vassilvitskii, S. , International Conference on Very Large Data Bases, (2008)
The Hiring Problem and Lake Wobegon Strategies Broder, A.; Kirsch, A.; Kumar, R.; Mitzenmacher, M.; Upfal, E.; Vassilvitskii, S. , Symposium on Discrete Algorithms, (2008)
2007
k-means++: The advantages of Careful Seeding Arthur, D.; Vassilvitskii, S. , Symposium on Discrete Algorithms, (2007)
On threshold behavior in query incentive networks. Arcaute, E.; Kirsch, A.; Kumar, R.; Liben-Nowell, D.; Vassilvitskii, S. , ACM Conference on Electronic Commerce, p.66-74, (2007)
2006
Distinct Value Estimators in Power Law Distributions. Motwani, R.; Vassilvitskii, S. , (2006)
How slow is the k-means method? Arthur, D.; Vassilvitskii, S. , Symposium on Computational Geometry, (2006)
Using Web Graph Distance For Relevance Feedback in Web Search Vassilvitskii, S.; Brill, E. , SIGIR, (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
Efficiently Computing Succinct Trade-off Curves. Vassilvitskii, S.; Yannakakis, M. , ICALP, (2004)
Copyright © 2008 Yahoo! Inc. All rights reserved.