Zobrazeno 1 - 10
of 580
pro vyhledávání: '"Beimel, A."'
Autor:
Sarah E. Lammers, Gabrielle L. Schnellman, Claudia Beimel, Arthur de Gast, Brooke E. Chambers
Publikováno v:
Journal of Orthopaedic Surgery and Research, Vol 19, Iss 1, Pp 1-17 (2024)
Abstract Introduction Selecting the optimal radial head prosthesis to treat radial head fractures, especially in the context of complex elbow injuries like terrible triad, Monteggia, and Essex Lopresti, can be challenging, as there is currently no co
Externí odkaz:
https://doaj.org/article/878e1a27a0914303aaad4cc625f0c4b3
Publikováno v:
Frontiers in Education, Vol 9 (2024)
IntroductionIn recent years, numerous studies have compared traditional face-to-face (F2F) learning on campus with online learning, seeking to establish how the learning environment (online vs. F2F) affects outcomes such as student satisfaction and a
Externí odkaz:
https://doaj.org/article/90123fa3a35a4605937b8649f3b300f9
Autor:
Beimel, Amos, Kaplan, Haim, Mansour, Yishay, Nissim, Kobbi, Saranurak, Thatchaphol, Stemmer, Uri
A dynamic algorithm against an adaptive adversary is required to be correct when the adversary chooses the next update after seeing the previous outputs of the algorithm. We obtain faster dynamic algorithms against an adaptive adversary and separatio
Externí odkaz:
http://arxiv.org/abs/2111.03980
In his seminal work, Cleve [STOC '86] has proved that any $r$-round coin-flipping protocol can be efficiently biased by $\Theta(1/r)$. This lower bound was met for the two-party case by Moran, Naor, and Segev [Journal of Cryptology '16], and the thre
Externí odkaz:
http://arxiv.org/abs/2105.00743
The shuffle model of differential privacy was proposed as a viable model for performing distributed differentially private computations. Informally, the model consists of an untrusted analyzer that receives messages sent by participating parties via
Externí odkaz:
http://arxiv.org/abs/2009.13510
Let~$\cH$ be a class of boolean functions and consider a {\it composed class} $\cH'$ that is derived from~$\cH$ using some arbitrary aggregation rule (for example, $\cH'$ may be the class of all 3-wise majority-votes of functions in $\cH$). We upper
Externí odkaz:
http://arxiv.org/abs/2003.04509
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Motivated by the desire to bridge the utility gap between local and trusted curator models of differential privacy for practical applications, we initiate the theoretical study of a hybrid model introduced by "Blender" [Avent et al.,\ USENIX Security
Externí odkaz:
http://arxiv.org/abs/1912.08951
In a recent paper Chan et al. [SODA '19] proposed a relaxation of the notion of (full) memory obliviousness, which was introduced by Goldreich and Ostrovsky [J. ACM '96] and extensively researched by cryptographers. The new notion, differential obliv
Externí odkaz:
http://arxiv.org/abs/1905.01373
We present a private learner for halfspaces over an arbitrary finite domain $X\subset \mathbb{R}^d$ with sample complexity $mathrm{poly}(d,2^{\log^*|X|})$. The building block for this learner is a differentially private algorithm for locating an appr
Externí odkaz:
http://arxiv.org/abs/1902.10731