An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient \(k\) nearest neighbors searching algorithm for a query line. |
scientific article; zbMATH DE number 1915572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient \(k\) nearest neighbors searching algorithm for a query line. |
scientific article; zbMATH DE number 1915572 |
Statements
An efficient \(k\) nearest neighbors searching algorithm for a query line. (English)
0 references
25 May 2003
0 references
Nearest and farthest neighbor
0 references
Query line
0 references
Arrangement
0 references
Duality
0 references
