Výsledky vyhledávání - "Planche, Léo"

Report

The Effect of Graph Connecitivity on Metastability on a Stochastic System of Spiking Neurons

Publikováno v: Stochastic Processes and their Applications, Volume 131, January 2021, Pages 292-310

We consider a continuous-time stochastic model of spiking neurons. In this model, we have a finite or countable number of neurons which are vertices in some graph $G$ where the edges indicate the synaptic connection between them. We focus on metastab

Externí odkaz: http://arxiv.org/abs/1910.00055

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem

Autor: Birmelé, Etienne, De Montgolfier, Fabien, Planche, Léo

The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9] who described

Externí odkaz: http://arxiv.org/abs/1609.04593

Zobrazit plný text záznamu

Akademický článek

The effect of graph connectivity on metastability in a stochastic system of spiking neurons

Autor: André, Morgan, Planche, Léo

Publikováno v: In Stochastic Processes and their Applications January 2021 131:292-310

Zobrazit plný text záznamu

Akademický článek

Decomposing a graph into shortest paths with bounded eccentricity

Autor: Birmelé, Etienne, de Montgolfier, Fabien, Planche, Léo, Viennot, Laurent

Publikováno v: In Discrete Applied Mathematics 30 September 2020 284:353-374

Zobrazit plný text záznamu

Akademický článek

On the Minimum Eccentricity Isometric Cycle Problem

Autor: Birmelé, Étienne, de Montgolfier, Fabien, Planche, Léo

Publikováno v: In Electronic Notes in Theoretical Computer Science 30 August 2019 346:159-169

Zobrazit plný text záznamu

Décomposition de graphes en plus courts chemins et en cycles de faible excentricité

Autor: Planche, Léo

Publikováno v: Mathématique discrète [cs.DM]. Paris Descartes, 2018. Français

In collaboration with researchers in biology at Université Pierre et Marie Curie, we study graphs coming from biological data in order to improve our understanding of it. Those graphs come from DNA fragments, named reads.Each read is a vertex and tw

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::719a08162f66eb92d868a197aeca7c80
https://theses.hal.science/tel-01994139

Zobrazit plný text záznamu

Decomposing a Graph into Shortest Paths with Bounded Eccentricity

Autor: Laurent Viennot, Fabien de Montgolfier, Etienne Birmelé, Léo Planche

Publikováno v: 28th International Symposium on Algorithms and Computation (ISAAC 2017)
28th International Symposium on Algorithms and Computation (ISAAC 2017), Dec 2017, Phuket, Thailand. ⟨10.4230/LIPIcs.ISAAC.2017.15⟩
MAP5 2017-18. 2017

International audience; We introduce the problem of hub-laminar decomposition which generalizes that of computing a shortest path with minimum eccentricity (MESP). Intuitively, it consists in decomposing a graph into several paths that collectively h

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc23302dbd295b2c90be084fe997562f
https://hal.science/hal-01511357v2/document

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání