Članki z zahtevami za javni dostop - Cyrus RashtchianVeč o tem
Na voljo nekje: 18
Random access in large-scale DNA data storage
L Organick, SD Ang, YJ Chen, R Lopez, S Yekhanin, K Makarychev, ...
Nature biotechnology 36 (3), 242-248, 2018
Zahteve: US National Science Foundation
A closer look at accuracy vs. robustness
YY Yang, C Rashtchian, H Zhang, RR Salakhutdinov, K Chaudhuri
Advances in neural information processing systems 33, 8588-8601, 2020
Zahteve: US National Science Foundation, US Department of Defense
Explainable k-means and k-medians clustering
M Moshkovitz, S Dasgupta, C Rashtchian, N Frost
International conference on machine learning, 7055-7065, 2020
Zahteve: US National Science Foundation, European Commission
Robustness for non-parametric classification: A generic attack and defense
YY Yang, C Rashtchian, Y Wang, K Chaudhuri
International Conference on Artificial Intelligence and Statistics, 941-951, 2020
Zahteve: US National Science Foundation, US Department of Defense
Edge estimation with independent set oracles
P Beame, S Har-Peled, SN Ramamoorthy, C Rashtchian, M Sinha
ACM Transactions on Algorithms (TALG) 16 (4), 1-27, 2020
Zahteve: US National Science Foundation
Coding for efficient DNA synthesis
A Lenz, Y Liu, C Rashtchian, PH Siegel, A Wachter-Zeh, E Yaakobi
2020 IEEE International Symposium on Information Theory (ISIT), 2885-2890, 2020
Zahteve: US National Science Foundation, European Commission
Trace reconstruction problems in computational biology
V Bhardwaj, PA Pevzner, C Rashtchian, Y Safonova
IEEE Transactions on Information Theory 67 (6), 3295-3314, 2020
Zahteve: US National Science Foundation, US National Institutes of Health
Approximate trace reconstruction: Algorithms
S Davies, MZ Rácz, BG Schiffer, C Rashtchian
2021 IEEE International Symposium on Information Theory (ISIT), 2525-2530, 2021
Zahteve: US National Science Foundation
Batch optimization for DNA synthesis
K Makarychev, MZ Rácz, C Rashtchian, S Yekhanin
IEEE Transactions on Information Theory 68 (11), 7454-7470, 2022
Zahteve: US National Science Foundation
Lower bounds on the total variation distance between mixtures of two gaussians
S Davies, A Mazumdar, S Pal, C Rashtchian
International Conference on Algorithmic Learning Theory, 319-341, 2022
Zahteve: US National Science Foundation
Equivalence of systematic linear data structures and matrix rigidity
S Natarajan Ramamoorthy, C Rashtchian
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 35 …, 2020
Zahteve: US National Science Foundation
Lsf-join: Locality sensitive filtering for distributed all-pairs set similarity under skew
C Rashtchian, A Sharma, D Woodruff
Proceedings of The Web Conference 2020, 2998-3004, 2020
Zahteve: US National Science Foundation
Covering codes using insertions or deletions
A Lenz, C Rashtchian, PH Siegel, E Yaakobi
IEEE Transactions on Information Theory 67 (6), 3376-3388, 2020
Zahteve: US National Science Foundation, European Commission
Massively-parallel similarity join, edge-isoperimetry, and distance correlations on the hypercube
P Beame, C Rashtchian
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Zahteve: US National Science Foundation
Average-case communication complexity of statistical problems
C Rashtchian, D Woodruff, P Ye, H Zhu
Conference on Learning Theory, 3859-3886, 2021
Zahteve: US National Science Foundation, US Department of Defense
Reconstructing trees from traces
S Davies, MZ Rácz, C Rashtchian
The Annals of Applied Probability 31 (6), 2772-2810, 2021
Zahteve: US National Science Foundation
Exact asymptotics for discrete noiseless channels
A Lenz, S Melczer, C Rashtchian, PH Siegel
2023 IEEE International Symposium on Information Theory (ISIT), 2494-2498, 2023
Zahteve: US National Science Foundation, Natural Sciences and Engineering Research …
Close Category Generalization
YY Yang, C Rashtchian, R Salakhutdinov, K Chaudhuri
CoRR, 2020
Zahteve: US National Science Foundation, US Department of Defense
Podatke o objavi in financiranju samodejno določi računalniški program