Login / Signup
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing.
Thijs Laarhoven
Published in:
CRYPTO (1) (2015)
Keyphrases
</>
locality sensitive hashing
nearest neighbor
nearest neighbor search
brute force
similarity search
binary codes
hash functions
indexing techniques
approximate nearest neighbor
metric space
hash tables
space efficient
multimedia retrieval
knn
vector space
sift features
range queries
feature vectors
euclidean distance
multimedia
exhaustive search
data sets
databases
neural network
decision trees
image sequences
multiscale
high dimensional
particle filter
co occurrence
multi dimensional
index structure
shortest path