HF RL Explorer

Task: Implement Locality Sensitive Hashing (LSH) for Approximate Nearest Neighbor Search in C

Task: Implement Locality Sensitive Hashing (LSH) for Approximate Nearest Neighbor Search in C: a task in Terminal-Lego-15k (Harbor dataset). Implement a Locality Sensitive Hashing (LSH) system in C that can efficiently find approximate nearest neighbors for high-dimensional vectors. LSH is a…

The task

Implement a Locality Sensitive Hashing (LSH) system in C that can efficiently find approximate nearest neighbors for high-dimensional vectors. LSH is a technique that hashes similar items into the same buckets with high probability, enabling sub-linear time approximate nearest neighbor search.

Part of PrimeIntellect/Terminal-Lego-15k.