233 citations
- Université d'OrléansFR47 papers
- Services déconcentrés d'appui à la recherche Val de LoireFR39 papers
- Centre National de la Recherche ScientifiqueFR29 papers
- Université de ToursFR16 papers
- Laboratoire d'Informatique Fondamentale d'Orléans13 papers
- GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR11 papers
- Institut Polytechnique de BordeauxFR9 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Université de BordeauxFR9 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR8 papers
- Czech Academy of SciencesCZ7 papers
- Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
6 papers · 1 filter
P-type behavior of CrN thin films by control of point defects
Arnaud le Febvrier, Davide Gambino, Fabien Giovannelli +5
We report the results of a combined experimental and theoretical study on nonstoichiometric CrN1+d thin films grown by reactive magnetron sputtering on c-plane sapphire, MgO (100)…
Vision Transformers For Weeds and Crops Classification Of High Resolution UAV Images
Reenul Reedha, Eric Dericquebourg, Raphael Canals +1
Crop and weed monitoring is an important challenge for agriculture and food production nowadays. Thanks to recent advances in data acquisition and computation technologies, agricul…
Random Dilated Shapelet Transform: A New Approach for Time Series Shapelets
Antoine Guillaume, Christel Vrain, Elloumi Wael
Shapelet-based algorithms are widely used for time series classification because of their ease of interpretation, but they are currently outperformed by recent state-of-the-art app…
Constraint tableaux for two-dimensional fuzzy logics
Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko
We introduce two-dimensional logics based on Łukasiewicz and Gödel logics to formalize paraconsistent fuzzy reasoning. The logics are interpreted on matrices, where the common unde…
Complexity and algorithms for injective edge-coloring in graphs
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
An injective -edge-coloring of a graph is an assignment of colors, i.e. integers in , to the edges of such that any two edges each incident with one d…
Characterizing extremal graphs for open neighbourhood location-domination
Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi +1
An open neighbourhood locating-dominating set is a set of vertices of a graph such that each vertex of has a neighbour in , and for any two vertices of , th…