BRESSAN, MARCO
BRESSAN, MARCO
Dipartimento di Informatica Giovanni Degli Antoni
Margin-based active learning of classifiers
2024 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
2024 M. Bressan, E. Esposito, M. Thiessen
A Theory of Interpretable Approximations
2024 M. Bressan, N. Cesa Bianchi, E. Esposito, Y. Mansour, S. Moran, M. Thiessen
Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees
2024 M. Bressan, M. Sozio
Fully-Dynamic Decision Trees
2023 M. Bressan, G. Damay, M. Sozio
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
2023 M. Bressan, M. Lanzinger, M. Roth
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
2023 M. Bressan
Counting Subgraphs in Somewhere Dense Graphs
2023 M. Bressan, L. Ann Goldberg, K. Meeks, M. Roth
Sublinear Algorithms for Local Graph-Centrality Estimation
2023 M. Bressan, E. Peserico, L. Pretto
Active Learning of Classifiers with Label and Seed Queries
2022 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice, M. Thiessen
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
2022 M. Bressan, M. Roth
Efficient and near-optimal algorithms for sampling connected subgraphs
2021 M. Bressan
Faster Motif Counting via Succinct Color Coding and Adaptive Sampling
2021 M. Bressan, S. Leucci, A. Panconesi
On Margin-Based Cluster Recovery with Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
2021 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Faster algorithms for counting subgraphs in sparse graphs
2021 M. Bressan
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
2020 M. Bressan, E. Peserico, L. Pretto
Exact Recovery of Mangled Clusters with Same-Cluster Queries
2020 M. Bressan, N. Cesa Bianchi, S. Lattanzi, A. Paudice
Faster subgraph counting in sparse graphs
2019 M. Bressan
Mixing time bounds for graphlet random walks
2019 M. Agostini, M. Bressan, S. Haddadan