Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Li, Jerry Zheng"'
Autor:
Li, Jerry Zheng
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and
Externí odkaz:
http://hdl.handle.net/1721.1/120382
Autor:
Li, Jerry Zheng
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Sp
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Sp
Externí odkaz:
http://hdl.handle.net/1721.1/97764
Publikováno v:
MIT web domain
All consensus hierarchies in the literature assume that we have, in addition to copies of a given object, an unbounded number of registers. But why do we really need these registers? This paper considers what would happen if one attempts to solve con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od________88::df8b6aa268aeb96cd486f92610e3a81f
https://orcid.org/0000-0003-4213-9898
https://orcid.org/0000-0003-4213-9898
Publikováno v:
Diakonikolas, I, Kamath, G, Kane, D M, Li, J, Moitra, A & Stewart, A 2016, Robust Estimators in High Dimensions without the Computational Intractability . in Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on . Institute of Electrical and Electronics Engineers (IEEE), pp. 655-664, 57th Annual Symposium on Foundations of Computer Science, New Brunswick, New Jersey, United States, 9/10/16 . https://doi.org/10.1109/FOCS.2016.85
FOCS
arXiv
FOCS
arXiv
We study high-dimensional distribution learning in an agnostic setting where an adversary is allowed to arbitrarily corrupt an epsilon fraction of the samples. Such questions have a rich history spanning statistics, machine learning and theoretical c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17a99d522d6fe5beaee25ca9c934796e
https://hdl.handle.net/20.500.11820/ef5fa408-03f0-4387-9a7b-9f42e054f653
https://hdl.handle.net/20.500.11820/ef5fa408-03f0-4387-9a7b-9f42e054f653
Publikováno v:
PPOPP
MIT web domain
MIT web domain
High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd72f999560755a30605b1cdf85c2ed3
https://doi.org/10.1145/2688500.2688523
https://doi.org/10.1145/2688500.2688523
