Pages that link to "Item:Q2327126"

The following pages link to An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time (Q2327126):

Displaying 2 items.

• An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
• A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)