Approximate \(k\)-closest-pairs in large high-dimensional data sets
type: Item
instance of: scholarly article
title: Approximate \(k\)-closest-pairs in large high-dimensional data sets
zbMATH Open document ID: 1084.68140
author: Fabrizio Angiulli
author: Clara Pizzuti
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2006-02-08T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5004525
zbMATH Keywords: Space Filling Curves
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s10852-004-4080-3
OpenAlex ID: W2115964863
cites work: Q5674437
cites work: Q4410531
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Q4140384
cites work: Q4828970
cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem
cites work: Q4403756
cites work: Q4250231
cites work: Q4148820
cites work: Sublinear time algorithms for metric space problems
cites work: FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
cites work: A simple randomized sieve algorithm for the closest-pair problem
cites work: Q4349924
cites work: Q4230362
cites work: Q3694703
cites work: Cure: An efficient clustering algorithm for large databases
cites work: Space-filling curves
cites work: An optimal algorithm for the on-line closest-pair problem
cites work: Q4945521
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
DOI: 10.1007/S10852-004-4080-3
description: scientific article; zbMATH DE number 5004525