Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Krehbiel, Sara"'
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$. These colo
Externí odkaz:
http://arxiv.org/abs/2401.12883
Autor:
Krehbiel, Sara
This dissertation focuses on strategic behavior and database privacy. First, we look at strategic behavior as a tool for distributed computation. We blend the perspectives of game theory and mechanism design in proposals for distributed solutions to
Externí odkaz:
http://hdl.handle.net/1853/53964
Publikováno v:
Proceedings of the International Conference on Machine Learning (2020) Pages 958-968
The change-point detection problem seeks to identify distributional changes in streams of data. Increasingly, tools for change-point detection are applied in settings where data may be highly sensitive and formal privacy guarantees are required, such
Externí odkaz:
http://arxiv.org/abs/1910.01327
Autor:
Bhakta, Prateek, Krehbiel, Sara, Morris, Rachel, Russell, Heather M., Sathe, Aalok, Su, Wesley, Xin, Maxine
Publikováno v:
In Advances in Applied Mathematics August 2023 149
Publikováno v:
Proceedings of the 32nd International Conference on Neural Information Processing Systems (2018) Pages 10848-10857
The change-point detection problem seeks to identify distributional changes at an unknown change-point k* in a stream of data. This problem appears in many important practical settings involving personal data, including biosurveillance, fault detecti
Externí odkaz:
http://arxiv.org/abs/1808.10056
We study the design of differentially private algorithms for adaptive analysis of dynamically growing databases, where a database accumulates new data entries while the analysis is ongoing. We provide a collection of tools for machine learning and ot
Externí odkaz:
http://arxiv.org/abs/1803.06416
Covering and packing problems can be modeled as games to encapsulate interesting social and engineering settings. These games have a high Price of Anarchy in their natural formulation. However, existing research applicable to specific instances of th
Externí odkaz:
http://arxiv.org/abs/1109.3606
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.
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.
Autor:
Wanrong Zhang1 WANRONGZ@GATECH.EDU, Krehbiel, Sara2 SKREHBIEL@SCU.EDU, Rui Tuo3 RUITUO@TAMU.EDU, Yajun Mei1 YMEI3@GATECH.EDU, Cummings, Rachel1 RACHELC@GATECH.EDU
Publikováno v:
Journal of Machine Learning Research. 2021, Vol. 22, p1-36. 36p.