activity
20062021
most citedA Distributed and Approximated Nearest Neighbors Algorithm for an Efficient Large Scale Mean Shift Clustering

32 citations · 40 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DC2021★ 2 cited

Challenges of Translating HPC codes to Workflows for Heterogeneous and Dynamic Environments

Fayssal Benkhaldoun, Christophe Cérin, Imad Kissami +1

In this paper we would like to share our experience for transforming a parallel code for a Computational Fluid Dynamics (CFD) problem into a parallel version for the RedisDG workfl…

cs.DC2021★ 2 cited

Towards Parallel CFD computation for the ADAPT framework

Imad Kissami, Christophe Cerin, Fayssal Benkhaldoun +1

In order to run Computational Fluid Dynamics (CFD) codes on large scale infrastructures, parallel computing has to be used because of the computational intensive nature of the prob…

cs.LG2019★ 32 cited

A Distributed and Approximated Nearest Neighbors Algorithm for an Efficient Large Scale Mean Shift Clustering

Gaël Beck, Tarn Duong, Mustapha Lebbah +2

In this paper we target the class of modal clustering methods where clusters are defined in terms of the local modes of the probability density function which generates the data. T…

cs.DC2014★ 2 cited

Backtracking algorithms for service selection

Yanik Ngoko, Christophe Cérin, Alfredo Goldman +1

In this paper, we explore the automation of services' compositions. We focus on the service selection problem. In the formulation that we consider, the problem's inputs are constit…

cs.DC2007★ 2 cited

Performance Analysis of Publish/Subscribe Systems

Heithem Abbes, Christophe Cérin, Jean-Christophe Dubacq +1

The Desktop Grid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. Its technology consists mainly in exploiting resources, g…

cs.DC2006

Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters

Christophe Cérin, Jean-Christophe Dubacq, Jean-Louis Roch +1

The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds…