-
La forme ou l'arithmetique du temps
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.... -
Generalized Fleming-Viot processes with immigration via stochastic flows of p...
typos and corrections in references. -
Penalty and Smoothing Methods for Convex Semi-Infinite Programming
International audience -
On the difference on two maximal monotone operators: Regularization and algor...
International audience -
An Exact Connection between two Solvable SDEs and a Nonlinear Utility Stochas...
Motivated by the work of Musiela and Zariphopoulou \cite{zar-03}, we study the Itô random fields which are utility functions $U(t,x)$ for any $(\omega,t)$. The main... -
Gaussian multiplicative chaos and KPZ duality
Typo fixed in the title. To appear in Communications in Mathematical Physics -
Quasistatic evolution in non-associative plasticity - The cap model
International audience -
Stochastic Utilities With a Given Optimal Portfolio : Approach by Stochastic ...
The paper generalizes the construction by stochastic flows of consistent utility processes introduced by M. Mrad and N. El Karoui in (2010). The utilities random... -
The omnipresence of Lagrange
International audience -
An Algorithm for Splitting Parallel Sums of Linearly Composed Monotone Operat...
We present a new primal-dual splitting algorithm for structured monotone inclusions in Hilbert spaces and analyze its asymptotic behavior. A novelty of our framework,... -
Fast mosaicing of cystoscopic images from dense correspondence: combined SURF...
International audience -
Chordal embeddings of planar graphs
Robertson and Seymour conjectured that the treewidth of a planar graph and the treewidth of its geometric dual differ by at most one. Lapoire solved this conjecture in... -
A simple proof of the tree-width duality theorem
We give a simple proof of the "tree-width duality theorem" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of... -
Viral Marketing On Configuration Model
We consider propagation of influence on a Configuration Model, where each vertex can be influenced by any of its neighbours but in its turn, it can only influence a... -
Codes over finite quotients of polynomial rings
International audience -
An Algorithm for Splitting Parallel Sums of Linearly Composed Monotone Operat...
International audience -
Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for C...
Extended formulations are now widely used to solve hard combinatorial optimization problems. Such formulations have prohibitively-many variables and are generally... -
A splitting algorithm for coupled system of primal-dual monotone inclusions
We propose a splitting algorithm for solving a coupled system of primal-dual monotone inclusions in real Hilbert spaces. The proposed algorithm has a structure... -
Breaking a monad-comonad symmetry between computational effects
Extended version of Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2012, 22 (4), pp.719-722. 〈10.1017/S0960129511000752〉
