54 citations · 237 across the 33 of their papers we have counts for
6 papers · 1 filter
Sample compression schemes for balls in graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney +2
One of the open problems in machine learning is whether any set-family of VC-dimension admits a sample compression scheme of size . In this paper, we study this problem f…
Graphs with convex balls
Jérémie Chalopin, Victor Chepoi, Ugo Giocanti
In this paper, we investigate the graphs in which all balls are convex and the groups acting on them geometrically (which we call CB-graphs and CB-groups). These graphs have been i…
Medians in median graphs and their cube complexes in linear time
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1
The median of a set of vertices of a graph is the set of all vertices of minimizing the sum of distances from to all vertices of . In this paper, we present…
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Jérémie Chalopin, Victor Chepoi, Shay Moran +1
We examine connections between combinatorial notions that arise in machine learning and topological notions in cubical/simplicial geometry. These connections enable to export resul…
Lock-in Problem for Parallel Rotor-router Walks
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski +3
The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially pl…
Cop and robber games when the robber can hide and ride
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse +1
In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G. The cop captures the robber if both players are o…