Présentation
Le Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS) est une Unité Mixte de Recherche (UMR 6158) en informatique, et plus généralement en Sciences et Technologies de l'Information et de la Communication (STIC).
(lire la suite)Offres d'emplois
Keynotes à venir
|
Eric Colin de Verdière, Directeur de Recherche CNRS - LIGM - Champs-sur-Marne - 12 mars 2026 00:00 - None Algorithms for drawing graphs with no or few crossings in the plane, on surfaces, and beyond |
|
Dernières Publications
Hassan Maatouk, Didier Rullière, Xavier Bay - 23 septembre 2025
Efficient constrained Gaussian process approximation using elliptical slice sampling
Bayesian Analysis
Youssef Salman, Anis Hoayek, Mireille Batton-Hubert - 9 octobre 2025
Detecting Mean Shifts in a Class of Time Series CHARN Models with Application to Financial Data
Journal of Scientific Research and Reports
Cezar Mbiethieu, Norbert Tsopze, Engelbert Mephu Nguifo - 1 décembre 2025
XLITE-Unet: Extremely Light and Efficient Deep learning architecture with selective atrous and axial depthwise convolution for image segmentation
Computer Vision and Image Understanding
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen - 1 novembre 2025
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Discrete Mathematics
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès - 1 janvier 2026
Isometric path complexity of graphs
Discrete Mathematics
Efficient constrained Gaussian process approximation using elliptical slice sampling
Bayesian Analysis
Youssef Salman, Anis Hoayek, Mireille Batton-Hubert - 9 octobre 2025
Detecting Mean Shifts in a Class of Time Series CHARN Models with Application to Financial Data
Journal of Scientific Research and Reports
Cezar Mbiethieu, Norbert Tsopze, Engelbert Mephu Nguifo - 1 décembre 2025
XLITE-Unet: Extremely Light and Efficient Deep learning architecture with selective atrous and axial depthwise convolution for image segmentation
Computer Vision and Image Understanding
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen - 1 novembre 2025
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Discrete Mathematics
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès - 1 janvier 2026
Isometric path complexity of graphs
Discrete Mathematics