Search Results for author:
Found 3 papers, 0 papers with code
Non-Clashing Teaching Maps for Balls in Graphs
For Gromov-hyperbolic graphs, we design an approximate NCTM$^+$ for $\mathcal{B}(G)$ of size 2.
Sample compression schemes for balls in graphs
The compressor maps any realizable sample $X$ to a subsample $X'$ of size at most $k$.
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
On the positive side we present a new construction of an unlabeled sample compression scheme for maximum classes.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
