High-Dimensional Approximate r-Nets

The construction of r -nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate r -nets with respect to Euclidean distance. For any fixed ϵ > 0 , the approximation factor is...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 82; číslo 6; s. 1675 - 1702
Hlavní autori:	Avarikioti, Z., Emiris, I. Z., Kavouras, L., Psarros, I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2020 Springer Nature B.V Springer Verlag
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Clustering Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Euclidean geometry Geometry Mathematics Mathematics of Computing Metric Geometry Metric space Polynomials Software Theory of Computation General dimension Locality sensitive hashing Approximation algorithm nets Metric geometry
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!