Question 1: Single choice
easyAI-checkedNearest Neighbors & Kernel MethodsA hash table wants to avoid collisions. What does a locality-sensitive hash family want instead, so that it can find similar items without comparing all pairs?
1 question from Nearest Neighbors & Kernel Methods
1 question · 1 min · score and explanations at the end
A hash table wants to avoid collisions. What does a locality-sensitive hash family want instead, so that it can find similar items without comparing all pairs?