| NP-hardness of Euclidean sum-of-squares clustering D Aloise, A Deshpande, P Hansen, P Popat Machine learning 75, 245-248, 2009 | 1336 | 2009 |
| Implicit question query identification N Gupta, P Popat, SD Baker, S Venkatachary US Patent 9,898,554, 2018 | 209 | 2018 |
| Answer to question neural networks N Lao, LM Kaiser, N Gupta, A Mohiuddin, P Popat US Patent 11,093,813, 2021 | 25 | 2021 |
| Approximate Lasserre integrality gap for unique games S Khot, P Popat, R Saket International Workshop on Randomization and Approximation Techniques in …, 2010 | 22 | 2010 |
| 2 log1-εn hardness for the closest vector problem with preprocessing S Khot, P Popat, NK Vishnoi 44th Annual ACM Symposium on Theory of Computing, STOC'12, 277-288, 2012 | 17 | 2012 |
| Generating elements of answer-seeking queries and elements of answers Y Liu, P Popat, N Gupta, A Mohiuddin US Patent 10,592,540, 2020 | 11 | 2020 |
| Almost polynomial factor hardness for closest vector problem with preprocessing SA Khot, P Popat, NK Vishnoi SIAM Journal on Computing 43 (3), 1184-1205, 2014 | 8* | 2014 |
| On the hardness of pricing loss-leaders P Popat, Y Wu Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012 | 8 | 2012 |
| SDP gaps for 2-to-1 and other Label-Cover variants V Guruswami, S Khot, R O’Donnell, P Popat, M Tulsiani, Y Wu International Colloquium on Automata, Languages, and Programming, 617-628, 2010 | 6 | 2010 |
| Optimal amortized regret in every interval R Panigrahy, P Popat arXiv preprint arXiv:1304.7577, 2013 | 2 | 2013 |
| Multi source extraction and scoring of short query answers PD Popat, GB Gite, J Blitzer, J Madhavan, A Severyn US Patent App. 18/000,152, 2023 | 1 | 2023 |
| USING MACHINE TRANSLATION FOR QUERY REWRITE GENERATION M Ciaramita, A Andryeyev, B Behsaz, S Narayanan, N Gupta, N Houlsby, ... | 1 | 2016 |
| Fractal structures in adversarial prediction R Panigrahy, P Popat Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 1 | 2015 |
| Inapproximability Reductions and Integrality Gaps P Popat New York University, 2013 | | 2013 |
| NP-hardness of Euclidean sum-of-squares clustering P POPAT Machine Learning 75 (2), 2008 | | 2008 |
Pierre HansenGERAD, HEC CanadaVerified email at hec.ca
