Author of the publication

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.

, , , , and . SISAP, volume 13058 of Lecture Notes in Computer Science, page 337-351. Springer, (2021)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the robustness of randomized classifiers to adversarial examples., , , , , and . Mach. Learn., 111 (9): 3425-3457 (2022)Challenges in anomaly and change point detection., , and . ESANN, (2022)Multi-winner approval voting goes epistemic., , and . UAI, volume 180 of Proceedings of Machine Learning Research, page 75-84. PMLR, (2022)Truth-Tracking via Approval Voting: Size Matters., , and . AAAI, page 4768-4775. AAAI Press, (2022)Theoretical evidence for adversarial robustness through randomization., , , , , , and . NeurIPS, page 11838-11848. (2019)The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections., , , , and . SISAP, volume 13058 of Lecture Notes in Computer Science, page 337-351. Springer, (2021)Temporal Sequences of EEG Covariance Matrices for Automated Sleep Stage Scoring with Attention Mechanisms., , , , , and . CAIP (2), volume 14185 of Lecture Notes in Computer Science, page 67-76. Springer, (2023)Oblique principal subspace tracking on manifold., , , and . ICASSP, page 2429-2432. IEEE, (2012)Automatic Classification of Sleep Stages from EEG Signals Using Riemannian Metrics and Transformer Networks., , , , and . CoRR, (2024)A Differentiable Approximation of the Graph Edit Distance., , , , , and . S+SSPR, volume 15444 of Lecture Notes in Computer Science, page 1-10. Springer, (2024)