Latency-Optimal Geo-Distributed Storage over Structured Networks
It is shown that for every fixed number of files, computing a latency-minimizing assignment is NP-hard via a reduction from the domatic number problem.
AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 127 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
It is shown that for every fixed number of files, computing a latency-minimizing assignment is NP-hard via a reduction from the domatic number problem.
This work considers normalized histograms as distribution estimators and characterize the asymptotically optimal domain-aware privacy mechanism within a specific class of DP mechanisms, and introduces PubMix, a public-data-aware DP mechanism that can be used in histogram-based data synthesis pipelines.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.