An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7146685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN |
scientific article; zbMATH DE number 7146685 |
Statements
An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (English)
0 references
27 December 2019
0 references
computational geometry
0 references
approximate nearest neighbor
0 references
reduction
0 references
0 references
0.8444342613220215
0 references
0.7414258122444153
0 references
0.7320224642753601
0 references
0.7291990518569946
0 references
