7 citations · 9 across the 4 of their papers we have counts for
4 papers
Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience
Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo
For a group of users in where everyone observes a component of a discrete multiple random source, the process that users exchange data so as to reach omniscience, the state whe…
A Submodularity-based Agglomerative Clustering Algorithm for the Privacy Funnel
Ni Ding, Parastoo Sadeghi
For the privacy funnel (PF) problem, we propose an efficient iterative agglomerative clustering algorithm based on the minimization of the difference of submodular functions (IAC-M…
Attaining Fairness in Communication for Omniscience
Ni Ding, Parastoo Sadeghi, David Smith +1
This paper studies how to attain fairness in communication for omniscience, where a set of users exchange their observations of a discrete multiple random source to attain omniscie…
A Faster Algorithm for Asymptotic Communication for Omniscience
Ni Ding, Chung Chan, Qiaoqiao Zhou +2
We propose a modified decomposition algorithm (MDA) to solve the asymptotic communication for omniscience (CO) problem where the communication rates could be real or fractional. By…