|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | On clusterings: good, bad, and spectral显示文摘 | KANNAN R VEMPALA S VETYA A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 2 | On clusterings:good,bad,and spectral显示文摘 | Kannan R Vempala S Vetta A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 3 | On clusterings显示文摘 | Ravi Kannan Santosh Vempala Adrian Vetta | 2004 | Journal of the ACM (JACM)2004，，3： | 1 |
| 4 | Efficient algorithm for universal portfolio显示文摘 | Kalai A Vempala S | 2002 | Journal of Machine Learning Research2002，3，： | 1 |
| 5 | On clusterings: Good, bad and spectral显示文摘 | Kannan R Vempala S Vetta A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 6 | Latent Semantic Indexing: A Probabilistic Analysis显示文摘 | Christos H. Papadimitriou Prabhakar Raghavan Hisao Tamaki Santosh Vempala | 2000 | Journal of Computer and System Sciences2000，，2： | 1 |
| 7 | Fast Monte-Carlo algorithm for finding low-rank approximations 显示文摘 | Frieze A Kannan R Vempala S | 2004 | Journal of the ACM2004，51，6： | 1 |
| 8 | On the approximability of the traveling salesman problem 显示文摘 | Papadimitriou C H Vempala S | 2006 | Combinatoriea2006，26，1： | 1 |
| 9 | Fast Monte Carlo algorithms for finding low-rank approximations 显示文摘 | Frieze A Kannan R Vempala S | 2004 | Journal of the ACM2004，51，6： | 1 |
| 10 | Clustering Large Graphs via the Singular Value Decomposition显示文摘 | P. Drineas A. Frieze R. Kannan S. Vempala V. Vinay | 2004 | Machine Learning2004，，1： | 1 |
| 11 | On clusterings: Good, bad and spectral 显示文摘 | Ravi Kannan Santosh Vempala Adrian Vetta | 2004 | ACM2004，51，3： | 1 |
| 12 | On Clusterings: Good, Bad and Spectral显示文摘 | Kannan R Vempala S Vetta A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 13 | Fast Monte Carlo algorithms for finding low-rank approximations显示文摘 | Frieze A Kannan R Vempala S | | 0，，06： | 1 |
| 14 | On clusterings: Good, bad and spectral 显示文摘 | KANNAN R VEMPALA S VETTA A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 15 | On clusterings igood , bad,and spectral显示文摘 | KANNAN R VEMPALA S VETTA A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 16 | A divide-and-merge methodology for clustering 显示文摘 | Cheng D Kannan R Vempala S | 2006 | ACM2006，31，4： | 1 |
| 17 | On clusterings:Good,bad and spectral显示文摘 | Kannan R Vempala S Vetta A | 2004 | Journal of the ACM2004，51，3： | 1 |
| 18 | Efficient algorithm for universal portfolio显示文摘 | Kalai A Vempala S | 2003 | Journal of Machine Learning Research2003，3，42： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员