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
5 papers · 1 filter
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting
Xavier Goaoc, Andreas Holmsen, Cyril Nicaud
We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in . We show that this question,…
Exploit fully automatic low-level segmented PET data for training high-level deep learning algorithms for the corresponding CT data
Christina Gsaxner, Peter M. Roth, Jürgen Wallner +1
We present an approach for fully automatic urinary bladder segmentation in CT images with artificial neural networks in this study. Automatic medical image analysis has become an i…
GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding
Zhaocheng Zhu, Shizhen Xu, Meng Qu +1
Learning continuous representations of nodes is attracting growing interest in both academia and industry recently, due to their simplicity and effectiveness in a variety of applic…
Computed tomography data collection of the complete human mandible and valid clinical ground truth models
Jürgen Wallner, Irene Mischak, Jan Egger
Image-based algorithmic software segmentation is an increasingly important topic in many medical fields. Algorithmic segmentation is used for medical three-dimensional visualizatio…
Hamiltonicity below Dirac's condition
Bart M. P. Jansen, László Kozma, Jesper Nederlof
Dirac's theorem (1952) is a classical result of graph theory, stating that an -vertex graph () is Hamiltonian if every vertex has degree at least . Both the value…