Geometric covering using random fields

DOI10.1016/J.TCS.2025.115431MaRDI QIDQ6930246zbMATH OpenFDO

Authors Amit Shahar, Daniel Keren, Felipe Gonçalves, Gal Yehuda

Publication date 16 September 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

clusteringGaussian random fieldsrandom fieldsproperty testinghash functionsEuclidean distancestochastic fieldsgeometric set cover problem

Mathematics Subject Classification ID

Random fields (60G60) Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 3482665 (Why is no real title available?)
• scientific article; zbMATH DE number 1256715 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 6781418 (Why is no real title available?)
• scientific article; zbMATH DE number 3226547 (Why is no real title available?)
• scientific article; zbMATH DE number 3278469 (Why is no real title available?)
• 10.1162/15324430260185646
• A general expression for the distribution of the maximum of a Gaussian field and the approximation of the tail
• Covering a ball with smaller equal balls in R^n
• From ``Dirac Combs to Fourier-positivity
• Gaussian processes for machine learning.
• Helly-type theorems in property testing
• Locality-sensitive hashing scheme based on \(p\)-stable distributions
• Numerical bounds for the distributions of the maxima of some one- and two-parameter Gaussian processes
• On positive positive-definite functions and Bochner's theorem
• Probabilistic counting algorithms for data base applications
• Testing of Clustering

This page was built for publication: Geometric covering using random fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930246)