I'm an associate professor at ITU Copenhagen working on randomized algorithms.
Stars
5
stars
written in C
Clear filter
FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
C library to compute the Hamming weight of arrays
A high-performance hash-table for network packet-processing applications (compatible with DPDK)
Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest neighbor search with inner product.
Scalable DBSCAN and OPTICS for clustering high-dimensional datasets using random projections