Concept

Arbre binaire

Publications associées (151)

Succinct ordering and aggregation constraints in algebraic array theories

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

Field Guide to Northern Tree-related Microhabitats: Descriptions and size limits for their inventory in boreal and hemiboreal forests of Europe and North America

Rita Bütler Sauvain

A tree-related microhabitat (abbreviated as TreM) is a morphological feature present on a tree, which is used by sometimes highly specialised species during at least one part of their life cycle. These features may serve as shelters, breeding spots, or cru ...

Swiss Federal Institute for Forest, Snow and Landscape Research WSL, Switzerland2024

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 ...

SPRINGER2023

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 involve ...

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, Tyler Joe Kohler, Stylianos Fodelianakis, Paraskevi Pramateftaki, Vincent Henri De Staercke, Matteo Tolosano, Michail Styllas, Martina Andrea Schön

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

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 due ...

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

Sequential metric dimension for random graphs

Patrick Thiran, Gergely Odor

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

2021

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search