Zobrazeno 1 - 10
of 395
pro vyhledávání: '"DuCoffe A"'
A ($\lambda,\mu$)-bow metric was defined in (Dragan & Ducoffe, 2023) as a far reaching generalization of an $\alpha_i$-metric (which is equivalent to a ($0,i$)-bow metric). A graph $G=(V,E)$ is said to satisfy ($\lambda,\mu$)-bow metric if for every
Externí odkaz:
http://arxiv.org/abs/2411.16548
Publikováno v:
SODA 2025, Jan 2025, Nouvelle Orl{\'e}ans (USA), United States
Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph classes for which their computation can be achieved in subquadratic time.
Externí odkaz:
http://arxiv.org/abs/2410.10235
Autor:
Cappi, Cyril, Cohen, Noémie, Ducoffe, Mélanie, Gabreau, Christophe, Gardes, Laurent, Gauffriau, Adrien, Ginestet, Jean-Brice, Mamalet, Franck, Mussot, Vincent, Pagetti, Claire, Vigouroux, David
This paper focuses on a Vision-based Landing task and presents the design and the validation of a dataset that would comply with the Operational Design Domain (ODD) of a Machine-Learning (ML) system. Relying on emerging certification standards, we de
Externí odkaz:
http://arxiv.org/abs/2406.14027
Publikováno v:
Symposium on Experimental Algorithms (SEA) 2024, Jul 2024, Vienne, Austria
For any set system $H=(V,R), \ R \subseteq 2^V$, a subset $S \subseteq V$ is called \emph{shattered} if every $S' \subseteq S$ results from the intersection of $S$ with some set in $\R$. The \emph{VC-dimension} of $H$ is the size of a largest shatter
Externí odkaz:
http://arxiv.org/abs/2405.07588
Autor:
Dragan, Feodor F., Ducoffe, Guillaume
A graph is called $\alpha_i$-metric ($i \in {\cal N}$) if it satisfies the following $\alpha_i$-metric property for every vertices $u, w, v$ and $x$: if a shortest path between $u$ and $w$ and a shortest path between $x$ and $v$ share a terminal edge
Externí odkaz:
http://arxiv.org/abs/2404.14792
Autor:
Cohen, Noémie, Ducoffe, Mélanie, Boumazouza, Ryma, Gabreau, Christophe, Pagetti, Claire, Pucel, Xavier, Galametz, Audrey
We introduce a novel Interval Bound Propagation (IBP) approach for the formal verification of object detection models, specifically targeting the Intersection over Union (IoU) metric. The approach has been implemented in an open source code, named IB
Externí odkaz:
http://arxiv.org/abs/2403.08788
Autor:
Ducoffe, Mélanie, Povéda, Guillaume, Galametz, Audrey, Boumazouza, Ryma, Martin, Marion-Cécile, Baris, Julien, Daverschot, Derk, O'Higgins, Eugene
Surrogate Neural Networks are nowadays routinely used in industry as substitutes for computationally demanding engineering simulations (e.g., in structural analysis). They allow to generate faster predictions and thus analyses in industrial applicati
Externí odkaz:
http://arxiv.org/abs/2401.06821
Autor:
Elboher, Yizhak, Elsaleh, Raya, Isac, Omri, Ducoffe, Mélanie, Galametz, Audrey, Povéda, Guillaume, Boumazouza, Ryma, Cohen, Noémie, Katz, Guy
As deep neural networks (DNNs) are becoming the prominent solution for many computational problems, the aviation industry seeks to explore their potential in alleviating pilot workload and in improving operational safety. However, the use of DNNs in
Externí odkaz:
http://arxiv.org/abs/2402.00035
Autor:
Dragan, Feodor F., Ducoffe, Guillaume
We extend known results on chordal graphs and distance-hereditary graphs to much larger graph classes by using only a common metric property of these graphs. Specifically, a graph is called $\alpha_i$-metric ($i\in \mathcal{N}$) if it satisfies the f
Externí odkaz:
http://arxiv.org/abs/2305.02545
Autor:
Ducoffe, Mélanie, Carrere, Maxime, Féliers, Léo, Gauffriau, Adrien, Mussot, Vincent, Pagetti, Claire, Sammour, Thierry
As the interest in autonomous systems continues to grow, one of the major challenges is collecting sufficient and representative real-world data. Despite the strong practical and commercial interest in autonomous landing systems in the aerospace fiel
Externí odkaz:
http://arxiv.org/abs/2304.09938