Author:
Romild Christoffer J. W.,Schauser Thomas H.,Borup Joachim Alexander
Publisher
Springer Nature Switzerland
Reference8 articles.
1. Aumüller, M., Bernhardsson, E., Faithfull, A.: Ann-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020) https://doi.org/10.1016/j.is.2019.02.006, https://www.sciencedirect.com/science/article/pii/S0306437918303685
2. Aumüller, M., Christiani, T., Pagh, R., Vesterli, M.: PUFFINN: parameterless and universally fast finding of nearest neighbors. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, September 9–11, 2019, Munich/Garching, Germany. LIPIcs, vol. 144, pp. 10:1–10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.ESA.2019.10
3. Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: Ellis, A., Hagino, T. (eds.) Proceedings of the 14th International Conference on World Wide Web, WWW 2005, Chiba, Japan, 10–14 May 2005, pp. 651–660. ACM (2005). https://doi.org/10.1145/1060745.1060840,
4. Chavez, E.L., Téllez, E.S., Aumüller, M.: Sisap 2023 datasets: 1024-bit binary sketches (hamming) (2023). https://sisap-challenges.github.io/datasets/#1024-bit_binary_sketches_hamming
5. Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions (2004). https://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p253-datar.pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献