Zobrazeno 1 - 10
of 338
pro vyhledávání: '"Ratel, Sébastien"'
Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and showed it is the most efficient machine teaching model satisfying the Goldman-Mathias collusion-avoidance criterion. A teaching map $T$ for a c
Externí odkaz:
http://arxiv.org/abs/2309.02876
Publikováno v:
SIAM Journal on Discrete Mathematics, 37(4):2585-2616, 2023
One of the open problems in machine learning is whether any set-family of VC-dimension $d$ admits a sample compression scheme of size $O(d)$. In this paper, we study this problem for balls in graphs. For a ball $B=B_r(x)$ of a graph $G=(V,E)$, a real
Externí odkaz:
http://arxiv.org/abs/2206.13254
$k$-Approximate distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the $k$-approximation of the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspectin
Externí odkaz:
http://arxiv.org/abs/2007.14192
Autor:
Piponnier, Enzo, Martin, Vincent, Chalchat, Emeric, Bontemps, Bastien, Julian, Valérie, Bocock, Olivia, Duclos, Martine, Ratel, Sébastien
Publikováno v:
Medicine & Science in Sports & exercise, ACSM, In press
Purpose The purpose of this study was to compare the development and etiology of neuromuscular fatigue of the knee extensor muscles (KE) at different muscle-tendon unit (MTU) lengths during repeated maximal voluntary isometric contractions (MVIC) bet
Externí odkaz:
http://arxiv.org/abs/1903.11335
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspecting the labels of $u$ and $v$, without usin
Externí odkaz:
http://arxiv.org/abs/1809.10508
Publikováno v:
In Information and Computation November 2022 289 Part A
Let $\mathcal S$ be a family of subsets of a set $X$ of cardinality $m$ and $\text{VC-dim}(\mathcal S)$ be the Vapnik-Chervonenkis dimension of $\mathcal S$. Haussler, Littlestone, and Warmuth (Inf. Comput., 1994) proved that if $G_1(\mathcal S)=(V,E
Externí odkaz:
http://arxiv.org/abs/1711.11414
In this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs $G$ of Cartesian products $G_1\times\cdots\times G_m$ of arbitrary connected graphs. Namely, we show that $\frac{|E(G)|}{|V(G)|}\le \lceil 2\max\
Externí odkaz:
http://arxiv.org/abs/1711.11485