6 citations · 10 across the 2 of their papers we have counts for
3 papers
cs.DB2024★ 4 cited
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
Jianyang Gao, Cheng Long
Searching for approximate nearest neighbors (ANN) in the high-dimensional Euclidean space is a pivotal problem. Recently, with the help of fast SIMD-based implementations, Product…
cs.DB2023
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
Kaiqiang Yu, Cheng Long
Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis. One notable cohesive structure is -quasi-clique (QC), where each vertex connects at least…
cs.DS2023★ 6 cited
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
Jianyang Gao, Cheng Long
Approximate K nearest neighbor (AKNN) search is a fundamental and challenging problem. We observe that in high-dimensional space, the time consumption of nearly all AKNN algorithms…