Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
Jean-Daniel Boissonnat, David Cohen-Steiner, Gert ...