On a nearest-neighbor problem under Minkowski and power metrics for large data sets
From MaRDI portal
Publication:1610602
DOI10.1023/A:1014310721543zbMath1002.68199OpenAlexW1571741349MaRDI QIDQ1610602
Publication date: 20 August 2002
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014310721543
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (2)
β-Skeleton depth functions and medians ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
This page was built for publication: On a nearest-neighbor problem under Minkowski and power metrics for large data sets