Preprocessing Trade-offs
Preprocessing Trade-Offs is a computational consideration in nearest neighbor search that characterizes the balance between the time, space, or complexity costs of preprocessing the data structure and the resulting gains in query efficiency or accuracy.
32
Publications
2.1K
Citations
69
Authors
40
Institutions
Publications per year
2017–2026
8
Parents
32
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
Piotr Indyk · 1998 · 319 citations
1–5 of 32
69
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 69
40

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
4 publications
406 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
62 citations
Universitat Politècnica de València
Valencia, Spain
2 h-index
2 publications
340 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
3 publications
174 citations

University of Southern Denmark
Odense, Denmark
2 h-index
2 publications
53 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
85 citations

The Graduate Center, CUNY
New York, United States
1 h-index
3 publications
69 citations

King Abdulaziz University
Jeddah, Saudi Arabia
1 h-index
2 publications
618 citations
1–8 of 40
1 publications · 13 citations
1
h-index
1 publications · 28 citations
1
h-index
Conference · 1 publications · 29 citations
1
h-index
JACM · 1 publications · 232 citations
1
h-index
1 publications · 309 citations
1
h-index
1–5