-
Exploring Gafni's reduction land: from $\Omega^k$ to wait-free adaptive $(2p-...
The adaptive renaming problem consists in designing an algorithm that allows $p$ processes (in a set of $n$ processes) to obtain new names despite asynchrony and... -
Interactive quantum chemistry: A divide-and-conquer ASED-MO method
International audience -
Block-Adaptive Quantum Mechanics: An Adaptive Divide-and-Conquer Approach to ...
International audience -
Multidimensional divide-and-conquer maximin recurrences
Projet EURECA -
Large-scale and high-quality multi-view stereo
Acquisition of 3D model of real objects and scenes is indispensable and useful in many practical applications, such as digital archives, game and entertainment... -
Triangulation de Delaunay et arbres multidimensionnels
This thesis deals mainly with Delaunay triangulations. It is shown that the average complexity of k-dimensional merge processes - according to unRnished sites - is... -
Scalable Domain Decomposition Preconditioners for Heterogeneous Elliptic Prob...
International audience -
The packing problem : A divide and conquer algorithm on cellular automata
International audience -
Fast global and partial reflective symmetry analyses using boundary surfaces ...
International audience
