Articles by Marco Bressan | Synthical

Synthical

Your space

Profile

Activity

Favorites

Folders

Feeds

Contacts

About

Simple

Original

Articles by Marco Bressan

On Finding Randomly Planted Cliques in Arbitrary Graphs

7 days ago by Francesco Agrimonti and others

Computational Complexity, Discrete Mathematics

Of Dice and Games: A Theory of Generalized Boosting

11 December 2024 by Marco Bressan and others

Machine Learning

GPT-4 based AI agents - the new expert system for detection of antimicrobial resistance mechanisms?

17 October 2024 by C. Gieske and others at

Universität Zürich

A Theory of Interpretable Approximations

15 June 2024 by Marco Bressan and others

Machine Learning, Artificial Intelligence

Efficient Algorithms for Learning Monophonic Halfspaces in Graphs

1 May 2024 by Marco Bressan and others

Machine Learning

Counting Subgraphs in Somewhere Dense Graphs

12 April 2024 by Marco Bressan and others

Computational Complexity, Discrete Mathematics

Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees

10 February 2023 by Marco Bressan and Mauro Sozio

Data Structures and Algorithms, Artificial Intelligence

Fully-Dynamic Decision Trees

1 December 2022 by Marco Bressan and others

Machine Learning, Artificial Intelligence

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree

3 November 2022 by Marco Bressan and others

Computational Complexity, Discrete Mathematics

Faster motif counting via succinct color coding and adaptive sampling

17 July 2021 by Marco Bressan and others

Data Structures and Algorithms, Databases

Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries

13 July 2021 by Marco Bressan and others

Machine Learning

On Margin-Based Cluster Recovery with Oracle Queries

9 June 2021 by Marco Bressan and others

Machine Learning

Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies

1 June 2021 by Marco Bressan and Marc Roth

Computational Complexity, Data Structures and Algorithms

Sampling connected subgraphs: nearly-optimal mixing time bounds, nearly-optimal ε-uniform sampling, and perfect uniform sampling

8 November 2020 by Marco Bressan

Data Structures and Algorithms, Discrete Mathematics

Exact Recovery of Mangled Clusters with Same-Cluster Queries

8 October 2020 by Marco Bressan and others

Machine Learning

A Hedgehog-FGF signaling axis patterns anterior mesoderm during gastrulation

19 June 2020 by Andrea Guzzetta and others at

University of Chicago

Developmental Biology

Correlation Clustering with Adaptive Similarity Queries

4 November 2019 by Marco Bressan and others

Machine Learning

Motivo: fast motif counting via succinct color coding and adaptive sampling

4 June 2019 by Marco Bressan and others

Databases, Discrete Mathematics

Optimized Cas9 expression systems for highly efficient Arabidopsis genome editing facilitate isolation of complex alleles in a single generation

23 February 2019 by J. Ordon and others

On exploiting degeneracy to count subgraphs

27 July 2018 by Marco Bressan

Computational Complexity

Approximating PageRank locally with sublinear query complexity

5 February 2018 by Marco Bressan and others

Data Structures and Algorithms, Information Retrieval

On approximating the stationary distribution of time-reversible Markov chains

30 December 2017 by Marco Bressan and others

Discrete Mathematics

The Limits of Popularity-Based Recommendations, and the Role of Social Ties

14 July 2016 by Marco Bressan and others

Social and Information Networks, Physics and Society

The Power of Local Information in PageRank

1 April 2016 by Marco Bressan and others

Discrete Mathematics, Social and Information Networks

Simple set cardinality estimation through random sampling

18 January 2016 by Marco Bressan and others

Discrete Mathematics

Articles by Marco Bressan | Synthical