Research interests and publications
Ram, P., & Sinha, K. (2019). Revisiting kd-tree for nearest neighbor search. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 1378-1388). paper code slides
Keivani, O., Sinha, K., & Ram, P. (2017). Improved maximum inner product search with better theoretical guarantees. In 2017 International Joint Conference on Neural Networks (IJCNN) (pp. 2927-2934). IEEE. paper
Curtin, R. R., Ram, P., & Gray, A. G. (2013). Fast exact max-kernel search. In Proceedings of the 2013 SIAM International Conference on Data Mining (pp. 1-9). Society for Industrial and Applied Mathematics. paper code (Best paper finalist)
Ram, P., & Gray, A. (2013). Which space partitioning tree to use for search?. Advances in Neural Information Processing Systems, 26. paper
Koenigstein, N., Ram, P., & Shavitt, Y. (2012). Efficient retrieval of recommendations in a matrix factorization framework. In Proceedings of the 21st ACM international conference on Information and knowledge management (pp. 535-544). paper
Ram, P., & Gray, A. G. (2012). Maximum inner-product search using cone trees. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 931-939). paper code arXiv
Ram, P., Lee, D., & Gray, A. G. (2012). Nearest-neighbor search on a time budget via max-margin trees. In Proceedings of the 2012 SIAM International Conference on Data Mining (pp. 1011-1022). Society for Industrial and Applied Mathematics. paper
March, W. B., Ram, P., & Gray, A. G. (2010). Fast Euclidean minimum spanning tree: algorithm, analysis, and applications. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 603-612). paper code
Ram, P., Lee, D., Ouyang, H., & Gray, A. (2009). Rank-approximate nearest neighbor search: Retaining meaning and speed in high dimensions. Advances in Neural Information Processing Systems, 22. paper
Ram, P., Lee, D., March, W., & Gray, A. (2009). Linear-time algorithms for pairwise statistical problems. Advances in Neural Information Processing Systems, 22. paper code
Keivani, O., Sinha, K., & Ram, P. (2018). Improved maximum inner product search with better theoretical guarantee using randomized partition trees. Machine Learning, 107(6), 1069-1094. paper
Curtin, R. R., & Ram, P. (2014). Dual-tree fast exact max-kernel search. Statistical Analysis and Data Mining: The ASA Data Science Journal, 7(4), 229-253. paper code
Curtin, R. R., Cline, J. R., Slagle, N. P., March, W. B., Ram, P., Mehta, N. A., & Gray, A. G. (2013). MLPACK: A scalable C++ machine learning library. The Journal of Machine Learning Research, 14(1), 801-805. paper code arXiv