Successive omniscience C Chan, A Al-Bashabsheh, Q Zhou, N Ding, T Liu, A Sprintson
IEEE Transactions on Information Theory 62 (6), 3270-3289, 2016
35 2016 Speaker variability in emotion recognition-an adaptation based approach N Ding, V Sethu, J Epps, E Ambikairajah
2012 IEEE International Conference on Acoustics, Speech and Signal …, 2012
28 2012 A submodularity-based clustering algorithm for the information bottleneck and privacy funnel N Ding, P Sadeghi
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
17 2019 Determining optimal rates for communication for omniscience N Ding, C Chan, Q Zhou, RA Kennedy, P Sadeghi
IEEE Transactions on Information Theory 64 (3), 1919-1944, 2017
12 2017 Measuring information leakage in non-stochastic brute-force guessing F Farokhi, N Ding
2020 IEEE Information Theory Workshop (ITW), 1-5, 2021
11 2021 Developing non-stochastic privacy-preserving policies using agglomerative clustering N Ding, F Farokhi
IEEE Transactions on Information Forensics and Security 15, 3911-3923, 2020
10 2020 Iterative merging algorithm for cooperative data exchange N Ding, RA Kennedy, P Sadeghi
2015 International Symposium on Network Coding (NetCod), 41-45, 2015
10 2015 On properties and optimization of information-theoretic privacy watchdog P Sadeghi, N Ding, T Rakotoarivelo
2020 IEEE Information Theory Workshop (ITW), 1-5, 2021
9 2021 A game-theoretic perspective on communication for omniscience N Ding, C Chan, T Liu, RA Kennedy, P Sadeghi
2016 Australian Communications Theory Workshop (AusCTW), 95-100, 2016
9 2016 Privacy-utility tradeoff in a guessing framework inspired by index coding Y Liu, N Ding, P Sadeghi, T Rakotoarivelo
2020 IEEE International Symposium on Information Theory (ISIT), 926-931, 2020
7 2020 Evolutionary games for correlation-aware clustering in massive machine-to-machine networks N Sawyer, MN Soorki, W Saad, DB Smith, N Ding
IEEE Transactions on Communications 67 (9), 6527-6543, 2019
7 2019 Estimating minimum sum-rate for cooperative data exchange N Ding, RA Kennedy, P Sadeghi
2015 IEEE International Symposium on Information Theory (ISIT), 2618-2622, 2015
7 2015 Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach N Ding, RA Kennedy, P Sadeghi
2015 22nd International Conference on Telecommunications (ICT), 36-42, 2015
7 2015 A submodularity-based agglomerative clustering algorithm for the privacy funnel N Ding, P Sadeghi
arXiv preprint arXiv:1901.06629, 2019
6 2019 A faster algorithm for asymptotic communication for omniscience N Ding, C Chan, Q Zhou, RA Kennedy, P Sadeghi
2016 IEEE Globecom Workshops (GC Wkshps), 1-6, 2016
6 2016 Opportunistic network coding for two-way relay fading channels N Ding, I Nevat, GW Peters, J Yuan
2013 IEEE International Conference on Communications (ICC), 5980-5985, 2013
6 2013 Kantorovich mechanism for pufferfish privacy N Ding
International Conference on Artificial Intelligence and Statistics, 5084-5103, 2022
5 2022 -Information-theoretic Privacy Watchdog and Optimal Privatization SchemeN Ding, MA Zarrabian, P Sadeghi
2021 IEEE International Symposium on Information Theory (ISIT), 2584-2589, 2021
5 2021 On Monotonicity of the Optimal Transmission Policy in Cross-Layer Adaptive -QAM Modulation N Ding, P Sadeghi, RA Kennedy
IEEE Transactions on Communications 64 (9), 3771-3785, 2016
5 2016 Fairness in communication for omniscience N Ding, C Chan, Q Zhou, RA Kennedy, P Sadeghi
2016 IEEE International Symposium on Information Theory (ISIT), 2314-2318, 2016
5 2016