Dynamic Partition Forest: An Efficient and Distributed Indexing Scheme for Similarity Search based on Hashing - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Yangdi Lu, Yang Bo, Wenbo He, Amir Nabatchian. Dynamic Partition Forest: An Efficient and Distributed Indexing Scheme for Similarity Search based on Hashing. In Naoki Abe, Huan Liu 0001, Calton Pu, Xiaohua Hu, Nesreen Ahmed, Mu Qiao, Yang Song, Donald Kossmann, Bing Liu 0001, Kisung Lee, Jiliang Tang, Jingrui He, Jeffrey Saltz, editors, IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018. pages 1059-1064, IEEE, 2018. [doi]

This author has not been identified. Look up 'Yangdi Lu' in GoogleThis author has not been identified. Look up 'Yang Bo' in GoogleThis author has not been identified. Look up 'Wenbo He' in GoogleThis author has not been identified. Look up 'Amir Nabatchian' in Google

runs on WebDSL