A survey on locality sensitive hashing algorithms and their applications

O Jafari, P Maurya, P Nagarkar, KM Islam… - arXiv preprint arXiv …, 2021 - arxiv.org
Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many
diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular …

A survey of binary code fingerprinting approaches: taxonomy, methodologies, and features

S Alrabaee, M Debbabi, L Wang - ACM Computing Surveys (CSUR), 2022 - dl.acm.org
Binary code fingerprinting is crucial in many security applications. Examples include
malware detection, software infringement, vulnerability analysis, and digital forensics. It is …

Fast approximate nearest neighbor search with the navigating spreading-out graph

C Fu, C Xiang, C Wang, D Cai - arXiv preprint arXiv:1707.00143, 2017 - arxiv.org
Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and
data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some …

Hashing for similarity search: A survey

J Wang, HT Shen, J Song, J Ji - arXiv preprint arXiv:1408.2927, 2014 - arxiv.org
Similarity search (nearest neighbor search) is a problem of pursuing the data items whose
distances to a query item are the smallest from a large database. Various methods have …

Query-aware locality-sensitive hashing for approximate nearest neighbor search

Q Huang, J Feng, Y Zhang, Q Fang, W Ng - Proceedings of the VLDB …, 2015 - dl.acm.org
Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for
the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional …

Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces

X Zhao, Y Tian, K Huang, B Zheng, X Zhou - Proceedings of the VLDB …, 2023 - dl.acm.org
The approximate nearest neighbor (ANN) search in high-dimensional spaces is a
fundamental but computationally very expensive problem. Many methods have been …

Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search

K Echihabi, K Zoumpatianos, T Palpanas… - arXiv preprint arXiv …, 2020 - arxiv.org
Data series are a special type of multidimensional data present in numerous domains,
where similarity search is a key operation that has been extensively studied in the data …

Supervised adaptive similarity matrix hashing

Y Shi, X Nie, X Liu, L Zou, Y Yin - IEEE Transactions on Image …, 2022 - ieeexplore.ieee.org
Compact hash codes can facilitate large-scale multimedia retrieval, significantly reducing
storage and computation. Most hashing methods learn hash functions based on the data …

Hd-index: Pushing the scalability-accuracy boundary for approximate knn search in high-dimensional spaces

A Arora, S Sinha, P Kumar, A Bhattacharya - arXiv preprint arXiv …, 2018 - arxiv.org
Nearest neighbor searching of large databases in high-dimensional spaces is inherently
difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary …

Kam1n0: Mapreduce-based assembly clone search for reverse engineering

SHH Ding, BCM Fung, P Charland - Proceedings of the 22nd ACM …, 2016 - dl.acm.org
Assembly code analysis is one of the critical processes for detecting and proving software
plagiarism and software patent infringements when the source code is unavailable. It is also …