Compression/Clustering (Vector Quantization) (k-ANNS Nearest Neighbor Search)

From Algorithm Wiki
Revision as of 09:29, 10 April 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == Varies by codebook structure == Space Complexity == Varies by codebook structure (Table 2) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 1992 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

Varies by codebook structure

Space Complexity

Varies by codebook structure

(Table 2)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

1992

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Compression/Clustering_(Vector_Quantization)_(k-ANNS_Nearest_Neighbor_Search)&oldid=47271"