6 citations · 10 across the 3 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
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…