Improved maximum inner product search with better theoretical guarantee using randomized partition trees
Crossref DOI link: https://doi.org/10.1007/s10994-018-5711-7
Published Online: 2018-04-23
Published Print: 2018-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Keivani, Omid
Sinha, Kaushik http://orcid.org/0000-0002-0025-5754
Ram, Parikshit
Text and Data Mining valid from 2018-04-23
Article History
Received: 12 May 2017
Accepted: 5 April 2018
First Online: 23 April 2018