GitHub

A fast approximate nearest neighbor search library for Go

Hann is a high-performance approximate nearest neighbor search (ANN) library for Go. It provides a collection of index data structures for efficient similarity search in high-dimensional spaces.
IEEE

A 28-nm 88.3-TFLOPS/W POSIT-Approximate-Calculation-Based Digital Computing-in-Memory Macro Incorporating Final-Cycle Fusion and Joint Skipping

Abstract: Computing-in-memory (CiM) architecture is considered a technology that promises to alleviate the memory wall problem in artificial intelligence (AI) computing. Previous work on digital CiM ...
IEEE

HDANNS: In-Memory Hyperdimensional Computing for Billion-Scale Approximate Nearest Neighbour Search Acceleration

Abstract: Data retrieval from large-scale database has laid the foundation for numerous crucial applications, including search engines and recommendation systems. Recently, the significance of ...
GitHub

ParAMD: Parallel Approximate Minimum Degree Algorithm

ParAMD is a shared memory parallel implementation of the approximate minimum degree (AMD) algorithm with multiple elimination via distance-2 independent sets. For more information, please read our ...