Omid Keivani

According to our database, Omid Keivani authored at least 5 papers between 2017 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Random projection-based auxiliary information can improve tree-based nearest neighbor search.

Omid Keivani, Kaushik Sinha

Inf. Sci., 2021

2018

Improved maximum inner product search with better theoretical guarantee using randomized partition trees.

Omid Keivani, Kaushik Sinha, Parikshit Ram

Mach. Learn., 2018

Improved nearest neighbor search using auxiliary information and priority functions.

Omid Keivani, Kaushik Sinha

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Improved maximum inner product search with better theoretical guarantees.

Omid Keivani, Kaushik Sinha, Parikshit Ram

Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

Sparse Randomized Partition Trees for Nearest Neighbor Search.

Kaushik Sinha, Omid Keivani

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017