Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Miklos Z Racz"'
Autor:
Randolph Lopez, Yuan-Jyue Chen, Siena Dumas Ang, Sergey Yekhanin, Konstantin Makarychev, Miklos Z Racz, Georg Seelig, Karin Strauss, Luis Ceze
Publikováno v:
Nature Communications, Vol 10, Iss 1, Pp 1-9 (2019)
A major bottleneck in using DNA as a data storage medium is the slowness of sequencing. Here the authors decode 1.67 megabytes of information using a portable nanopore platform with an assembly strategy for increased throughput.
Externí odkaz:
https://doaj.org/article/e07599e4d5704cedbc045adf5c88720f
Autor:
Mayee F. Chen, Miklos Z. Racz
Publikováno v:
IEEE Transactions on Network Science and Engineering. 9:728-739
The spread of misinformation has increased markedly in recent years, a phenomenon which has been accelerated and amplified by social media such as Facebook and Twitter. While some actors spread misinformation to push a specific agenda, others aim to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d617393d7f569bead648a9858fb7ab8d
https://doi.org/10.1109/tnse.2021.3131416
https://doi.org/10.1109/tnse.2021.3131416
Autor:
Jacob Richey, Miklos Z. Racz
Publikováno v:
IEEE Transactions on Network Science and Engineering. 8:2-12
Recent work, motivated by anonymous messaging platforms, has introduced adaptive diffusion protocols which can obfuscate the source of a rumor: a "snapshot adversary" with access to the subgraph of "infected" nodes can do no better than randomly gues
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf57357d7210b9b65411d374e0acd589
https://doi.org/10.1109/tnse.2020.3022621
https://doi.org/10.1109/tnse.2020.3022621
Publikováno v:
ISIT
We introduce approximate trace reconstruction, a relaxed version of the trace reconstruction problem. Here, instead of learning a binary string perfectly from noisy samples, as in the original trace reconstruction problem, the goal is to output a str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::371e8852eaac0d9306debeffcd51fb33
https://doi.org/10.1109/isit45174.2021.9517926
https://doi.org/10.1109/isit45174.2021.9517926
Publikováno v:
Ann. Appl. Probab. 30, no. 6 (2020), 2796-2814
It is well known that sequential decision making may lead to information cascades. That is, when agents make decisions based on their private information, as well as observing the actions of those before them, then it might be rational to ignore thei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14c6ba9adab393846ef99a75b8a63f74
https://projecteuclid.org/euclid.aoap/1607936461
https://projecteuclid.org/euclid.aoap/1607936461
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:2941-2972
Starting from a unit mass on a vertex of a graph, we investigate the minimum number of "\emph{controlled diffusion}" steps needed to transport a constant mass $p$ outside of the ball of radius $n$. In a step of a controlled diffusion process we may s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1272c9718472924a4e6b64b94ee467e0
https://doi.org/10.1137/17m1125923
https://doi.org/10.1137/17m1125923
Autor:
Benjamin G. Schiffer, Miklos Z. Racz
Publikováno v:
Latin American Journal of Probability and Mathematical Statistics. 17:775
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. We determine (up to logarithmic factors) the number of queries necessar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e84945ea9ac8e62ce45ec2c7a327991d
https://doi.org/10.30757/alea.v17-30
https://doi.org/10.30757/alea.v17-30
Publikováno v:
arXiv
Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\frac{1}{2}}$ (and hence is likely t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18b2e1e15fb6888a0989339772b537bf
Publikováno v:
CIKM
We present an analysis of traffic to websites known for publishing fake news in the months preceding the 2016 US presidential election. The study is based on the combined instrumentation data from two popular desktop web browsers: Internet Explorer 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc58a34d4b42ecf014e2d468fc907547
https://doi.org/10.1145/3132847.3133147
https://doi.org/10.1145/3132847.3133147
Autor:
Cyrus Rashtchian, Luis Ceze, Georg Seelig, Sharon Newman, Randolph Lopez, Gagan Gupta, John Mulligan, Konstantin Makarychev, Robert Carlson, Karin Strauss, Sergey Yekhanin, Christopher N. Takahashi, Yuan-Jyue Chen, Lee Organick, Douglas Carmean, Kendall Stewart, Bichlien H. Nguyen, Miklos Z. Racz, Hsing Yeh Parker, Siena Dumas Ang, Parikshit Gopalan, Govinda M. Kamath
Publikováno v:
Nature biotechnology. 36(3)
200 MB of digital data is stored in DNA, randomly accessed and recovered using an error-free approach. Synthetic DNA is durable and can encode digital data with high density, making it an attractive medium for data storage. However, recovering stored
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce64edcc158a417bd528a389a7ed7e5e
https://pubmed.ncbi.nlm.nih.gov/29457795
https://pubmed.ncbi.nlm.nih.gov/29457795