Nov 25
Abstract : What are the performance guarantees of the algorithms used in practice for clustering problems? In a paper with Phil Klein and Claire Mathieu, we give the first polynomial-time approximation schemes for the following problems: (1) uniform facility location in edge-weighted planar graphs; (2) $k$-median and $k$-means in edge-weighted planar graphs; (3) $k$-means in …
Nov 23
Sorry, this entry is only available in French.
Sep 26
HDR dissertation by Tommaso Venturini under the Supervision of Pablo Jensen Ecole Normale Supérieure de Lyon Jury: Richard Rogers, Dominique Pestre, Dominique Vinck, didier bigo, Pablo Jensen, Eric Fleury Monday September 26th, 10:30AM. ENS de Lyon.
Sep 05
by Klaus Wehmuth, , Éric Fleury, , Artur Ziviani, http://www.sciencedirect.com/science/article/pii/S0304397516304352 Abstract Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks. We introduce the concept …
May 18
http://www.sciencedirect.com/science/article/pii/S0140366416301955 We analyze a very large Call Detail Records (CDR) over 12 months in Mexico. It contains 8 millions users ans 5 billions of call events. Our first contribution is the study call duration and inter-arrival time parameters. Then, we assess user movements between consecutive calls (switching from a station to another one). Our study …
Jan 07
Lyon MAY 11-13, 2016 — Lyon JUNE 20-22, 2016 — Marseille JULY 11-13, 2016 http://netspringlyon.fr The semester Network Science is organized by the project team DANTE (Ecole normale supérieure de Lyon, Université Claude Bernard (Lyon 1), CNRS, Laboratoire de l’Informatique du Parallélisme — UMR5668), the SiSyPhe team (Ecole normale supérieure de Lyon, Université Claude Bernard (Lyon 1), CNRS, …
Please log into the site.
