—Distributed Feature Composition (DFC) is a new technology for feature specification and composition, based on a virtual architecture offering benefits analogous to those of a pi...
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...
Abstract I will report on some recent developments concerning the problem of estimating the Hausdorff dimension of the singular sets of solutions to elliptic and variational proble...
This paper presents an asynchronous implementation of a failure detector for unknown and mobile networks. Our approach does not rely on timers. Neither the composition nor the numb...
Pierre Sens, Luciana Arantes, Mathieu Bouillaguet,...