Privacy sets for constrained space-filling
classification
📊 stat.ME
keywords
notionprivacysetsalgorithmalongcallcentralcompare
read the original abstract
The paper provides typology for space filling into what we call "soft" and "hard" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.