1. Antonio Boffa , Paolo Ferragina , and Giorgio Vinciguerra . 2021. A "Learned" Approach to Quicken and Compress Rank/ Select Dictionaries . In ALENEX . SIAM , 46--59. Antonio Boffa, Paolo Ferragina, and Giorgio Vinciguerra. 2021. A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. In ALENEX. SIAM, 46--59.
2. Zhangjie Cao , Mingsheng Long , Jianmin Wang , and Philip S . Yu . 2017 . HashNet: Deep Learning to Hash by Continuation. In ICCV. IEEE Computer Society , 5609--5618. Zhangjie Cao, Mingsheng Long, Jianmin Wang, and Philip S. Yu. 2017. HashNet: Deep Learning to Hash by Continuation. In ICCV. IEEE Computer Society, 5609--5618.
3. Francisco M. Castro , Manuel J. Mar'i n-Jimé nez , Nicolá s Guil, Cordelia Schmid, and Karteek Alahari. 2018 . End-to-End Incremental Learning. In ECCV (12) (Lecture Notes in Computer Science , Vol. 11216). Springer, 241-- 257 . Francisco M. Castro, Manuel J. Mar'i n-Jimé nez, Nicolá s Guil, Cordelia Schmid, and Karteek Alahari. 2018. End-to-End Incremental Learning. In ECCV (12) (Lecture Notes in Computer Science, Vol. 11216). Springer, 241--257.
4. Chih-Chung Chang and Chih-Jen Lin. 2021. libsvm. https://www.csie.ntu.edu.tw/ cjlin/libsvm/ Retrieved 2021-05--25 from Chih-Chung Chang and Chih-Jen Lin. 2021. libsvm. https://www.csie.ntu.edu.tw/ cjlin/libsvm/ Retrieved 2021-05--25 from
5. Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. ACM 380--388. Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In STOC. ACM 380--388.