Artículos con órdenes de acceso público - Daniel CullinaMás información
No disponibles en ningún lugar: 2
Restricted composition deletion correcting codes
D Cullina, N Kiyavash, AA Kulkarni
IEEE Transactions on Information Theory 62 (9), 4819-4832, 2016
Órdenes: US National Science Foundation
Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption
AE Ghassami, D Cullina, N Kiyavash
2016 IEEE International Symposium on Information Theory (ISIT), 1371-1375, 2016
Órdenes: US National Science Foundation
Disponibles en algún lugar: 13
Pac-learning in the presence of adversaries
D Cullina, AN Bhagoji, P Mittal
Advances in Neural Information Processing Systems 31, 2018
Órdenes: US National Science Foundation, US Department of Defense
Improved achievability and converse bounds for erdos-rényi graph matching
D Cullina, N Kiyavash
ACM SIGMETRICS performance evaluation review 44 (1), 63-72, 2016
Órdenes: US National Science Foundation
Lower bounds on adversarial robustness from optimal transport
AN Bhagoji, D Cullina, P Mittal
Advances in Neural Information Processing Systems 32, 2019
Órdenes: US National Science Foundation, US Department of Defense
Analyzing the robustness of open-world machine learning
V Sehwag, AN Bhagoji, L Song, C Sitawarin, D Cullina, M Chiang, P Mittal
Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security …, 2019
Órdenes: US National Science Foundation, US Department of Defense
Analysis of a canonical labeling algorithm for the alignment of correlated erdos-rényi graphs
OE Dai, D Cullina, N Kiyavash, M Grossglauser
Proceedings of the ACM on Measurement and Analysis of Computing Systems 3 (2 …, 2019
Órdenes: US National Science Foundation, US Department of Defense
Partial recovery of Erdős-Rényi graph alignment via k-core alignment
D Cullina, N Kiyavash, P Mittal, HV Poor
ACM SIGMETRICS Performance Evaluation Review 48 (1), 99-100, 2020
Órdenes: US National Science Foundation
Fundamental limits of database alignment
D Cullina, P Mittal, N Kiyavash
2018 IEEE International Symposium on Information Theory (ISIT), 651-655, 2018
Órdenes: US National Science Foundation
Lower bounds on cross-entropy loss in the presence of test-time adversaries
AN Bhagoji, D Cullina, V Sehwag, P Mittal
International Conference on Machine Learning, 863-873, 2021
Órdenes: US National Science Foundation, US Department of Defense
Speed optimization for tasks with two resources
A Melani, R Mancuso, D Cullina, M Caccamo, L Thiele
2016 Design, Automation & Test in Europe Conference & Exhibition (DATE …, 2016
Órdenes: US National Science Foundation
Rate-distance tradeoff for codes above graph capacity
D Cullina, M Dalai, Y Polyanskiy
2016 IEEE International Symposium on Information Theory (ISIT), 1331-1335, 2016
Órdenes: US National Science Foundation
Characterizing the Optimal Loss for Multi-class Classification with a Test-time Attacker
S Dai, W Ding, AN Bhagoji, D Cullina, H Zheng, B Zhao, P Mittal
Advances in Neural Information Processing Systems 36, 2024
Órdenes: US National Science Foundation, US Department of Defense
Optimizing resource speed for two-stage real-time tasks
A Melani, R Mancuso, D Cullina, M Caccamo, L Thiele
Real-Time Systems 53, 82-120, 2017
Órdenes: US National Science Foundation
A Theoretical Perspective on the Robustness of Feature Extractors
AN Bhagoji, D Cullina, BY Zhao
The Second Workshop on New Frontiers in Adversarial Machine Learning, 2023
Órdenes: US National Science Foundation, US Department of Defense
La información de publicación y financiación se determina de forma automática mediante un programa informático