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)Dernières Publications
Fabien Feschet, Jacques-Olivier Lachaud - 29 juin 2026
Controlled Peeling of Fully Convex Digital Sets and Thin Envelope
Journal of Mathematical Imaging and Vision
Fedi Oueslati, Ali Ben Abbes, Vincent Barra - 5 septembre 2026
Fourier-optimal loss for distortion and time in non-stationary time series forecasting
Information Sciences
Valentin Guien, Violaine Antoine, Romain Lardy, Isabelle Veissier, Luis Rocha - 19 juillet 2027
Characterization and Anomaly Detection in Daily Cow Activities Using Wavelet-Based Features
Lecture Notes in Networks and Systems
Ahmed Mahfouz, Kamal Almouh, Khouloud Samrouth, Nader Bakir, Gérard Chalhoub - 10 septembre 2026
BTFA: Behavioral Two Factor Authentication For IAM Systems
Mobile Networks and Applications
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi - 21 octobre 2026
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science
Controlled Peeling of Fully Convex Digital Sets and Thin Envelope
Journal of Mathematical Imaging and Vision
Fedi Oueslati, Ali Ben Abbes, Vincent Barra - 5 septembre 2026
Fourier-optimal loss for distortion and time in non-stationary time series forecasting
Information Sciences
Valentin Guien, Violaine Antoine, Romain Lardy, Isabelle Veissier, Luis Rocha - 19 juillet 2027
Characterization and Anomaly Detection in Daily Cow Activities Using Wavelet-Based Features
Lecture Notes in Networks and Systems
Ahmed Mahfouz, Kamal Almouh, Khouloud Samrouth, Nader Bakir, Gérard Chalhoub - 10 septembre 2026
BTFA: Behavioral Two Factor Authentication For IAM Systems
Mobile Networks and Applications
Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi - 21 octobre 2026
Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth
Theoretical Computer Science