265 citations
- Institut national de recherche en sciences et technologies du numériqueFR20 papers
- Geometric (India)IN8 papers
- Institut de Mathématiques de BordeauxFR8 papers
- Centre Inria de l'université de BordeauxFR7 papers
- Centre Inria de l'Université de LorraineFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR4 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR4 papers
- Nantes UniversitéFR4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- École PolytechniqueFR3 papers
- Graz University of TechnologyAT3 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR3 papers
14 papers · 1 filter
Vertebral body segmentation with GrowCut: Initial experience, workflow and practical application
Jan Egger, Christopher Nimsky, Xiaojun Chen
In this contribution, we used the GrowCut segmentation algorithm publicly available in three-dimensional Slicer for three-dimensional segmentation of vertebral bodies. To the best…
Hyperopic Cops and Robbers
A. Bonato, N. E. Clarke, D. Cox +3
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the…
Computing Treewidth on the GPU
Tom C. van der Zanden, Hans L. Bodlaender
We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm i…
Neighborhood-Based Label Propagation in Large Protein Graphs
Sabeur Aridhi, Seyed Ziaeddin Alborzi, Malika Smaïl-Tabbone +2
Understanding protein function is one of the keys to understanding life at the molecular level. It is also important in several scenarios including human disease and drug discovery…
Proving Expected Sensitivity of Probabilistic Programs
Gilles Barthe, Thomas Espitau, Benjamin Grégoire +2
Program sensitivity, also known as Lipschitz continuity, describes how small changes in a program's input lead to bounded changes in the output. We propose an average notion of pro…
Stochastic k-Server: How Should Uber Work?
Sina Dehghani, Soheil Ehsani, MohammadTaghi HajiAghayi +2
In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are servi…