( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Adversarial examples from computational constraints

, , и . (2018)cite arxiv:1805.10204Comment: 19 pages, 1 figure.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Pavlyukevich

Ilya Christoffel

 

Другие публикации лиц с тем же именем

Adversarial examples from computational constraints, , и . (2018)cite arxiv:1805.10204Comment: 19 pages, 1 figure.Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering., , и . CoRR, (2018)Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching., , , , и . CoRR, (2015)Separating Hierarchical and General Hub Labelings., , и . MFCS, том 8087 из Lecture Notes in Computer Science, стр. 469-479. Springer, (2013)Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering., , и . STOC, стр. 1027-1038. ACM, (2019)SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search., , , , , и . USENIX Security Symposium, стр. 2111-2128. USENIX Association, (2020)Robust Hierarchical k-Center Clustering., , , и . ITCS, стр. 211-218. ACM, (2015)A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks., , и . SOFSEM, том 5901 из Lecture Notes in Computer Science, стр. 165-175. Springer, (2010)Randomized Smoothing of All Shapes and Sizes., , , , , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 10693-10705. PMLR, (2020)On Model-Based RIP-1 Matrices., и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 564-575. Springer, (2013)