189 datasets found

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional...

23 pages, 24 eqs, 19 refs

International audience

International audience

The primary goal of the thesis is to study localization of Laplacian eigenfunctions in bounded domains when an eigenfunction is mainly supported by a small region of...

We study the dynamics of a transformation that acts on infinite pathsin the graph associated with Pascal's triangle. For each ergodicinvariant measure the asymptotic...

International audience

International audience

Cet article vise à répondre à la question de recherche suivante : " Dans un contexte de crise surmédiatisée, comment un décideur expert se comporte-t-il ? ". Nous...

This work is a study of the geometry of interaction in the hyperfinite factor introduced by Jean-Yves Girard, and of its relations with ancient constructions. We start...

Computational geometry aims to design and analyze algorithms for solving geometric problem. It is a recent field of theorical computer science, that rapidly developed...

International audience

Let k be a field and let f be a polynomial of degree n in k [T]. The symmetric relations are the polynomials in k [X1, ..., Xn] that vanish on all permutations of the...

Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless,...

In a previous article, an implementation of lazy p-adic integers with a multiplication of quasi-linear complexity, the so-called relaxed product, was presented. Given...

This book is designed as the experimental support which makes it possible to the reader to constitute his own imaginary representation of the contents of this writing....

International audience

International audience

International audience

International audience