Recherche

Afficher tous les résultats pour

Accueil

Concept

Arbre binaire

Science formelle
Informatique théorique
Algorithme
Structure de données

Publications associées (28)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Succinct ordering and aggregation constraints in algebraic array theories

Viktor Kuncak, Rodrigo Raya

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Reka Inovan

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

EPFL2024

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Effective field theory of the two Higgs doublet model

Timothy Cohen

We revisit the effective field theory of the two Higgs doublet model at tree level. The introduction of a novel basis in the UV theory allows us to derive matching coefficients in the effective description that resum important contributions from the Higgs ...

Springer Nature2023

Fundamental Limits in Statistical Learning Problems: Block Models and Neural Networks

Elisabetta Cornacchia

This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits. In th ...

EPFL2023

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view. Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B invol ...

EPFL2022

Genomic and metabolic adaptations of biofilms to ecological windows of opportunity in glacier-fed streams

Tom Ian Battin, Hannes Markus Peter, Susheel Bhanu Busi, Grégoire Marie Octave Edouard Michoud, Leïla Ezzat, Massimo Bourquin, Matteo Tolosano, Tyler Joe Kohler, Stylianos Fodelianakis, Paraskevi Pramateftaki

In glacier-fed streams, ecological windows of opportunity allow complex microbial biofilms to develop and transiently form the basis of the food web, thereby controlling key ecosystem processes. Using metagenome-assembled genomes, we unravel strategies tha ...

Springer2022

Key factors determining the presence of Tree-related Microhabitats: A synthesis of potential factors at site, stand and tree scales, with perspectives for further research

Rita Bütler Sauvain

Tree-related microhabitats (TreMs) have been identified as key features for forest-dwelling taxa and are often employed as measures for biodiversity conservation in integrative forest management. However, managing forests to ensure an uninterrupted resourc ...

2022

Abstractions for Type-Level Programming

Olivier Eric Paul Blanvillain

Over the past decade, the Scala community has shown great interest in using type-level programming to obtain additional type safety. Unfortunately, the lack of support from the Scala compiler has been a barrier to the adoption of that technique, notably du ...

EPFL2022

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Page 1 sur 3

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

EPFL2022

Key factors determining the presence of Tree-related Microhabitats: A synthesis of potential factors at site, stand and tree scales, with perspectives for further research

Rita Bütler Sauvain

2022

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

2021