A5044190443- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Limits and Structures in Graph Theory
- Graph Labeling and Dimension Problems
- Probabilistic and Robust Engineering Design
- semigroups and automata theory
- Optimization and Search Problems
- Statistical Distribution Estimation and Applications
- Computational Geometry and Mesh Generation
- Graph theory and applications
- Interconnection Networks and Systems
- Agriculture and Rural Development Research
- Reliability and Maintenance Optimization
- Flood Risk Assessment and Management
- French Urban and Social Studies
- Marine and fisheries research
- graph theory and CDMA systems
- Advanced Multi-Objective Optimization Algorithms
- Algorithms and Data Compression
- Markov Chains and Monte Carlo Methods
- DNA and Biological Computing
- Game Theory and Voting Systems
- Topological and Geometric Data Analysis
- Bayesian Modeling and Causal Inference
- Advanced Statistical Process Monitoring
Laboratoire d'Informatique en Images et Systèmes d'Information
2018-2025
Sorbonne Université
2020-2025
Laboratoire des Sciences pour la Conception, l'Optimisation et la Production
2014-2024
Centre National de la Recherche Scientifique
2014-2024
Gouvernance, Risque, Environnement, Développement
2024
LabEx PERSYVAL-Lab
2014-2024
Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique
2022-2024
Laboratoire de Recherche en Informatique
2022-2024
Laboratoire de Probabilités et Modèles Aléatoires
2018-2024
Laboratoire de Probabilités, Statistique et Modélisation
2018-2024
Let G=(V,E) be a graph on n vertices and R set of pairs in V called requests. A multicut is subset F E such that every request xy cut by F, i.e. xy-path G intersects F. We show there exists an O(f(k)nc) algorithm which decides if size at most k. In other words, the Multicut problem parameterized solution k Fixed-Parameter Tractable.
Sensitivity analysis (SA) of a numerical model, for instance simulating physical phenomena, is useful to quantify the influence inputs on model responses. This paper proposes new sensitivity index, based upon modification probability density function (pdf) random inputs, when quantity interest failure (probability that output exceeds given threshold). An input considered influential if pdf leads broad change in probability. These indices can be computed using sole set simulations has already...
The connection between the Call-By-Push-Value lambda-calculus introduced by Levy and Linear Logic Girard has been widely explored through a denotational view reflecting precise ruling of resources in this language. We take further step direction apply Taylor expansion Ehrhard Regnier. define resource whose terms can be used to approximate Call-By-Push-Value. show that approximation is coherent with reduction translations Call-By-Name Call-By-Value strategies into
Abstract The evaluation of the number mouse ovarian primordial follicles (PMF) can provide important information about function, regulation folliculogenesis or impact chemotherapy on fertility. This counting, usually performed by specialized operators, is a tedious, time-consuming but indispensable procedure.The development and increasing use deep machine learning algorithms promise to speed up improve this process. Here, we present new methodology automatically detecting counting PMF, using...
In this paper, we investigate the complexity of Maximum Independent Set (MIS) in class $H$-free graphs, that is, graphs excluding a fixed graph as an induced subgraph. Given problem remains $NP$-hard for most $H$, study its fixed-parameter tractability and make progress towards dichotomy between $FPT$ $W[1]$-hard cases. We first show MIS forbidding simultaneously $K_{1, 4}$, any finite set cycles length at least $4$, trees with two branching vertices. particular, answers open question...
A graph class $\mathcal{C}$ has polynomial expansion if there is a function $f$ such that for every $G\in \mathcal{C}$, each of the depth-$r$ minors $G$ average degree at most $f(r)$. In this note, we study bounded-radius variants some classical parameters as bramble number, linkedness and well-linkedness, show they are pairwise polynomially related. Furthermore, in monotone with all uniformly bounded by $r$.
This article focused on the definition and study of a binary Bayesian criterion which measures statistical agreement between subjective prior data information. The setting this work is concrete studies. It an alternative complementary tool to method recently proposed by Evans Moshonov, [M. H. Checking for Prior-data conflict, Anal. 1 (2006), pp. 893–914]. Both methods try help analyst, from preliminary posterior computation. Our defined as ratio Kullback–Leibler divergences; two its main...
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context geometric group theory. In this paper, we study generated graphs and their shortest path show applications to some continuous spaces. such graph metrics can be seen as a large scale generalisation weak diameter network decomposition which has been extensively studied computer science. We prove that every proper minor-closed family at most 2, gives optimal answers question Fujiwara Papasoglu (in...
The aim of this article is twofold: (i) modeling partially observed crack growth industrial components using gamma processes and (ii) providing estimators the best maintenance time in a statistical Bayesian framework. choice framework motivated by small size data, availability expert knowledge about propagation, more generally, concern integration parametrical uncertainties when optimizing action. answers to methodological question prior elicitation adopting strategy based on virtual data...