International audienceWe show that the shallow packing lemma follows from a simple modification of the standard proof, due to Haussler and simplified by Chazelle, of the packing lemma
The hitting set problem is a well-known NP-hard optimization problem in which, given a set of elemen...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
International audienceWe show that the shallow packing lemma follows from a simple modification of t...
International audienceWe refine the bound on the packing number, originally shown by Haussler, for s...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set s...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
We prove a size-sensitive version of Haussler's Packing lemma~\cite{Haussler92spherepacking} for set...
International audienceGiven a set system (X,R) such that every pair of sets in R have large symmetri...
33 pages.We study fine properties of Lévy trees that are random compact metric spaces introduced by ...
33 pages.We study fine properties of Lévy trees that are random compact metric spaces introduced by ...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
We prove a lower bound on the amount of nonuniform advice needed by black-box reductions for the Den...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
The hitting set problem is a well-known NP-hard optimization problem in which, given a set of elemen...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
International audienceWe show that the shallow packing lemma follows from a simple modification of t...
International audienceWe refine the bound on the packing number, originally shown by Haussler, for s...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set s...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
We prove a size-sensitive version of Haussler's Packing lemma~\cite{Haussler92spherepacking} for set...
International audienceGiven a set system (X,R) such that every pair of sets in R have large symmetri...
33 pages.We study fine properties of Lévy trees that are random compact metric spaces introduced by ...
33 pages.We study fine properties of Lévy trees that are random compact metric spaces introduced by ...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
We prove a lower bound on the amount of nonuniform advice needed by black-box reductions for the Den...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
The hitting set problem is a well-known NP-hard optimization problem in which, given a set of elemen...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
AbstractWe prove a lemma that is useful for obtaining upper bounds for the number of partitions with...
DOI
Add to ORKG