| Rethinking attention with performers K Choromanski, V Likhosherstov, D Dohan, X Song, A Gane, T Sarlos, ... arXiv preprint arXiv:2009.14794, 2020 | 1413 | 2020 |
| Improved approximation algorithms for large matrices via random projections T Sarlos 2006 47th annual IEEE symposium on foundations of computer science (FOCS'06 …, 2006 | 958 | 2006 |
| Fastfood-approximating kernel expansions in loglinear time Q Le, T Sarlós, A Smola Proceedings of the international conference on machine learning 85 (8), 2013 | 698* | 2013 |
| Faster least squares approximation P Drineas, MW Mahoney, S Muthukrishnan, T Sarlós Numerische mathematik 117 (2), 219-249, 2011 | 561 | 2011 |
| Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments D Fogaras, B Rácz, K Csalogány, T Sarlós Internet Mathematics 2 (3), 333-358, 2005 | 371 | 2005 |
| Spamrank–fully automatic link spam detection work in progress AA Benczur, K Csalogany, T Sarlos, M Uher Proceedings of the first international workshop on adversarial information …, 2005 | 306 | 2005 |
| A sparse johnson: Lindenstrauss transform A Dasgupta, R Kumar, T Sarlós Proceedings of the forty-second ACM symposium on Theory of computing, 341-350, 2010 | 235 | 2010 |
| Fast locality-sensitive hashing A Dasgupta, R Kumar, T Sarlós Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011 | 167 | 2011 |
| Are web users really markovian? F Chierichetti, R Kumar, P Raghavan, T Sarlos Proceedings of the 21st international conference on World Wide Web, 609-618, 2012 | 161 | 2012 |
| On scheduling in map-reduce and flow-shops B Moseley, A Dasgupta, R Kumar, T Sarlós Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011 | 146 | 2011 |
| To randomize or not to randomize: space optimal summaries for hyperlink analysis T Sarlós, AA Benczúr, K Csalogány, D Fogaras, B Rácz Proceedings of the 15th international conference on World Wide Web, 297-306, 2006 | 93 | 2006 |
| Masked language modeling for proteins via linearly scalable long-context transformers K Choromanski, V Likhosherstov, D Dohan, X Song, A Gane, T Sarlos, ... arXiv preprint arXiv:2006.03555, 2020 | 92 | 2020 |
| On estimating the average degree A Dasgupta, R Kumar, T Sarlos Proceedings of the 23rd international conference on World wide web, 795-806, 2014 | 90 | 2014 |
| Link-based similarity search to fight web spam A Benczúr, K Csalogány, T Sarlós Lehigh Univ., 2006 | 85 | 2006 |
| On sampling nodes in a network F Chiericetti, A Dasgupta, R Kumar, S Lattanzi, T Sarlós Proceedings of the 25th International Conference on World Wide Web, 471-481, 2016 | 70 | 2016 |
| Orienteering algorithms for generating travel itineraries Z Friggstad, S Gollapudi, K Kollias, T Sarlos, C Swamy, A Tomkins Proceedings of the eleventh ACM international conference on web search and …, 2018 | 53 | 2018 |
| Orthogonal estimation of Wasserstein distances M Rowland, J Hron, Y Tang, K Choromanski, T Sarlos, A Weller The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 47 | 2019 |
| Web spam detection via commercial intent analysis A Benczúr, I Bíró, K Csalogány, T Sarlós Proceedings of the 3rd international workshop on Adversarial information …, 2007 | 47 | 2007 |
| Structured adaptive and random spinners for fast machine learning computations M Bojarski, A Choromanska, K Choromanski, F Fagan, C Gouy-Pailler, ... Artificial intelligence and statistics, 1020-1029, 2017 | 43 | 2017 |
| The geometry of random features K Choromanski, M Rowland, T Sarlós, V Sindhwani, R Turner, A Weller International Conference on Artificial Intelligence and Statistics, 1-9, 2018 | 42 | 2018 |
Krzysztof ChoromanskiGoogle Brain Robotics New York & Columbia University在 columbia.edu 的电子邮件经过验证
