Search Results for author:
Found 1 papers, 0 papers with code
Graph-based Nearest Neighbor Search in Hyperbolic Spaces
From a theoretical perspective, we rigorously analyze the time and space complexity of graph-based NNS, assuming that an n-element dataset is uniformly distributed within a d-dimensional ball of radius R in the hyperbolic space of curvature -1.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
