Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On a nearest-neighbor problem under Minkowski and power metrics for large data sets

From MaRDI portal
Publication:1610602
Jump to:navigation, search

DOI10.1023/A:1014310721543zbMath1002.68199OpenAlexW1571741349MaRDI QIDQ1610602

Marina L. Gavrilova

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


zbMATH Keywords

Voronoi diagramnearest-neighbor problem


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1610602&oldid=13912364"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki