Author:
Arora Sanjeev,Hazan Elad,Kale Satyen
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Arora, S., Hazan, E., Kale, S.: Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In: 46th FOCS, pp. 339–348 (2005)
2. Achlioptas, D., McSherry, F.: Fast computation of low rank matrix approximations. In: 32nd STOC, pp. 611–618 (2001)
3. Drineas, P., Frieze, A.M., Kannan, R., Vempala, S., Vinay, V.: Clustering large graphs via the singular value decomposition. Machine Learning 56(1-3), 9–33 (2004)
4. Drineas, P., Kannan, R.: Pass efficient algorithms for approximating large matrices. In: SODA, pp. 223–232 (2003)
5. Lecture Notes in Computer Science;P. Drineas,2006
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献