Zobrazeno 1 - 10
of 1 795
pro vyhledávání: '"LI, George"'
Autor:
Dubins, Jerry
Publikováno v:
Fanfare: The Magazine for Serious Record Collectors. Nov/Dec2024, Vol. 48 Issue 2, p313-316. 4p.
Autor:
Dhulipala, Laxman, Li, George Z.
We introduce a new notion of neighboring databases for coverage problems such as Max Cover and Set Cover under differential privacy. In contrast to the standard privacy notion for these problems, which is analogous to node-privacy in graphs, our new
Externí odkaz:
http://arxiv.org/abs/2403.03337
Recent work by Dhulipala et al. \cite{DLRSSY22} initiated the study of the $k$-core decomposition problem under differential privacy via a connection between low round/depth distributed/parallel graph algorithms and private algorithms with small erro
Externí odkaz:
http://arxiv.org/abs/2312.07706
We study the question of whether submodular functions of random variables satisfying various notions of negative dependence satisfy Chernoff-like concentration inequalities. We prove such a concentration inequality for the lower tail when the random
Externí odkaz:
http://arxiv.org/abs/2309.05554
Autor:
Sieber, Patricia
Publikováno v:
TDR (1988-), 2016 Jul 01. 60(2), 164-165.
Externí odkaz:
http://www.jstor.org/stable/43835065
Autor:
Rolston, David
Publikováno v:
Asian Theatre Journal, 2015 Oct 01. 32(2), 663-671.
Externí odkaz:
http://www.jstor.org/stable/24737056
Autor:
Chen, Liana
Publikováno v:
The Journal of Asian Studies, 2015 May 01. 74(2), 466-467.
Externí odkaz:
https://www.jstor.org/stable/43553603
Autor:
Li, George Z.
In this note, we present a simple differentially private algorithm for the global minimum cut problem using only one call to the exponential mechanism. This problem was first studied by Gupta et al. [2010], and they gave a differentially private algo
Externí odkaz:
http://arxiv.org/abs/2208.09365