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

Authors

69

  1. CW
    Christian Wulff‐Nilsen

    University of Copenhagen, Denmark

    2 publications · 53 citations

    2

    h-index

  2. EV
    Enrique Vidal

    Universitat Politècnica de València, Spain

    2 publications · 340 citations

    2

    h-index

  3. OR
    Oded Regev

    Tel Aviv University, Israel

    2 publications · 54 citations

    2

    h-index

  4. SA
    Sunil Arya

    University of Maryland, College Park, United States

    2 publications · 246 citations

    2

    h-index

  5. AK
    Abhishek Kumar

    Chitkara University, India

    1 publications · 53 citations

    1

    h-index

1–5 of 69

Venues

  1. Journal of Computer and System Sciences

    1 publications · 13 citations

    1

    h-index

  2. Information Sciences

    1 publications · 28 citations

    1

    h-index

  3. European Conference on Artificial Intelligence

    Conference · 1 publications · 29 citations

    1

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 232 citations

    1

    h-index

  5. Knowledge-Based Systems

    1 publications · 309 citations

    1

    h-index

1–5