Search Results for author:
Found 2 papers, 1 papers with code
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
Approximate nearest neighbor search (ANNS) in high-dimensional spaces is a pivotal challenge in the field of machine learning.
Consistent and Flexible Selectivity Estimation for High-Dimensional Data
Selectivity estimation aims at estimating the number of database objects that satisfy a selection criterion.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
