Paper

Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing

Given a large dataset of binary codes and a binary query point, we address how to efficiently find $K$ codes in the dataset that yield the largest cosine similarities to the query. The straightforward answer to this problem is to compare the query with all items in the dataset, but this is practical only for small datasets... (read more)

Results in Papers With Code
(↓ scroll down to see all results)