Search Results for author: Jianyang Gao

Found 2 papers, 1 papers with code

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search

no code implementations21 May 2024 Jianyang Gao, Cheng Long

Recently, with the help of fast SIMD-based implementations, Product Quantization (PQ) and its variants can often efficiently and accurately estimate the distances between the vectors and have achieved great success in the in-memory ANN search.

High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations

1 code implementation17 Mar 2023 Jianyang Gao, Cheng Long

Approximate K nearest neighbor (AKNN) search is a fundamental and challenging problem.

Cannot find the paper you are looking for? You can Submit a new open access paper.