Kejing Lu

According to our database1, Kejing Lu authored at least 9 papers between 2018 and 2024.

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

2024
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2022
MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances.
Proc. VLDB Endow., 2022

2021
HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search.
Proc. VLDB Endow., 2021

AdaLSH: Adaptive LSH for Solving <i>c</i>-Approximate Maximum Inner Product Search Problem.
IEICE Trans. Inf. Syst., 2021

MLSH: Mixed Hash Function Family for Approximate Nearest Neighbor Search in Multiple Fractional Metrics.
Proceedings of the Database Systems for Advanced Applications, 2021

Approximate Query Processing with Error Guarantees.
Proceedings of the Big-Data-Analytics in Astronomy, Science, and Engineering, 2021

2020
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning.
Proc. VLDB Endow., 2020

R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2018
Why locality sensitive hashing works: A practical perspective.
Inf. Process. Lett., 2018


  Loading...