## Preprocess a set of n vectors V in d dimensions into a search data structure.

## Input: A query vector q.

## Ouput: The vector v in V that is nearest to q. That is, the vector v in V that minimizes

Previous slide | Next slide | Back to first slide | View graphic version |