Robin, Frédérique Sericola, Bruno Anceaume, Emmanuelle

This paper proposes and analyses the performance and the vulnerability to attacks of three algorithms for collecting longitudinal data in a large scale system. A monitoring device is in charge of continuously collecting measurements from end-devices. The communication graph is connected but not necessarily complete. For scalability reasons, at each...

Foussard, Christian Denis-Remis, Cédric

International audience

Basselin, Justine Alonso, Laurent Ray, Nicolas Sokolov, Dmitry Lefebvre, Sylvain Lévy, Bruno

We propose a method to simultaneously decompose a 3D object into power diagram cells and to integrate given functions in each of the obtained simple regions. We offer a novel, highly parallel algorithm that lends itself to an efficient GPU implementation. It is optimized for algorithms that need to compute many decompositions, for instance, centroi...

Braine, Julien Gonnord, Laure Monniaux, David

Proving properties on programs accessing data structures such as arrays often requires universally quantified invariants, e.g., "all elements below index $i$ are nonzero''. In this research report, we propose a general data abstraction scheme operating on Horn formulas, into which we recast previously published abstractions. We show our instantiati...

Chen, Lin Giovanidis, Anastasios Wang, Wei Shan, Lin

We formulate and analyze a generic sequential resource access problem arising in a variety of engineering fields, where a user disposes a number of heterogeneous computing, communication, or storage resources, each characterized by the probability of successfully executing the user's task and the related access delay and cost, and seeks an optimal ...

Angriman, Eugenio Meyerhenke, Henning Schulz, Christian Uçar, Bora

Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating the dynamic weighted matching problem. Our first algorithm is based on random walks/paths combined with dynamic programming. The second algorithm has been introduced by Stu...

Liu, Jin-Yi

Given two positive integers n and k with k ≤ n, let X denote the family of all the k-subsets of [n] := {1, 2, ..., n}. In this paper, assuming that the k-subsets in X hold some order of ranks, we consider the expected number of left-to-right maxima in some sequential ordering of X , under a random permutation of [n]. In the case k = 1, it is well-k...

Frosini, A. Picouleau, Christophe Rinaldi, S.

In hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity status of the reconstruction of $\cal H$ from $d$, are two challenging open problems. They can be formulated in the cont...

Créhange, Marion Lescanne, Pierre Quéré, Alain

Blaise, Léa Artigues, Christian Benoist, Thierry

International audience