Jianyang Gao

Orcid: 0009-0008-4684-3624

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search.
Proc. ACM Manag. Data, June, 2025

RaanA: A Fast, Flexible, and Data-Efficient Post-Training Quantization Algorithm.
CoRR, April, 2025

DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph.
Proc. ACM Manag. Data, February, 2025

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search.
Proc. ACM Manag. Data, February, 2025

2024
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search.
Proc. ACM Manag. Data, December, 2024

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search.
Proc. ACM Manag. Data, 2024

High-Dimensional Vector Quantization: General Framework, Recent Advances, and Future Directions.
IEEE Data Eng. Bull., 2024

2023
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations.
Proc. ACM Manag. Data, 2023


  Loading...