-
Using the $k-$nearest neighbor restricted Delaunay polyhedron to estimate the...
We consider random samples in $\mathbb{R}^d$ drawn from an unknown density. This paper is devoted to the study the properties of the Delaunay polyhedron restricted to... -
A tight bound for the Delaunay triangulation of points on a polyhedron
International audience -
Abstract acceleration in Linear relation analysis
{Linear Relation Analysis~\cite{cousot78,halbwach79} is now a classical abstract interpretation based on an approximation of reachable numerical states of a program by... -
Polyèdres et compilation
International audience -
Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra
Given a weighted undirected graph G with a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable... -
Clôture intégrale et opérations de tores algébriques de complexité un dans le...
Transform. Groups 18 (2013), no. 3, 739-765. -
Polyhedral realisation of hyperbolic metrics with conical singularities on co...
International audience
