SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (Q4030349): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60162793, #quickstatements; #temporary_batch_1706327624897 |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q178859 / rank | |||
Property / author | |||
Property / author: Q170478 / rank | |||
Property / author | |||
Property / author: Matthew T. Dickerson / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Robert L. Scot Drysdale / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1142/s0218195992000147 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2109157304 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS |
scientific article |
Statements
SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS (English)
0 references
1 April 1993
0 references
enumeration
0 references
selection
0 references
nearest neighbors
0 references
Delaunay triangulation
0 references