Jianyang Gao

According to our database, Jianyang Gao authored at least 8 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph.

Ziqi Yin, Jianyang Gao, Pasquale Balsebre, Gao Cong, Cheng Long

CoRR, February, 2025

2024

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search.

Yuexuan Xu, Jianyang Gao, Yutong Gou, Cheng Long, Christian S. Jensen

Proc. ACM Manag. Data, December, 2024

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

Jianyang Gao, Cheng Long

Proc. ACM Manag. Data, 2024

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search.

Yutong Gou, Jianyang Gao, Yuexuan Xu, Cheng Long

CoRR, 2024

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search.

Jianyang Gao, Yutong Gou, Yuexuan Xu, Yongyi Yang, Cheng Long, Raymond Chi-Wing Wong

CoRR, 2024

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

Jianyang Gao, Cheng Long

CoRR, 2024

2023

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

Jianyang Gao, Cheng Long

Proc. ACM Manag. Data, 2023

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

Jianyang Gao, Cheng Long

CoRR, 2023