SuCo uses subspace collision counting with inverted multi-indexes to deliver fast and compact approximate nearest neighbor search, though its theoretical guarantees are not rigorously established.
Expected Values and Moments
1 Pith paper cite this work, alongside 5 external citations. Polarity classification is still indexing.
1
Pith paper citing it
5
external citations · OpenAlex
fields
cs.DB 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
SuCo uses subspace collision counting with inverted multi-indexes to deliver fast and compact approximate nearest neighbor search, though its theoretical guarantees are not rigorously established.