Diffusion scientifique
Dernières publications
Fast Landmark Reconfiguration for Highway Cover Indexes
Communication lors d'une conférence
David Coudert, Andrea D Ascenzo, Mattia d'Emidio, Giuseppe F Italiano
The highway cover labeling (HCL) is an indexing method for weighted digraphs that enables fast queries on important graph properties such as distances and constrained shortest paths. Originally introduced by [Farhan et al., EDBT 2019], the HCL has gained popularity in the field…
DIVA: An Ontology-based Approach to Model User Activity within Visualization Systems
Communication lors d'une conférence
Aline Menin, Catherine Faron
The study of user activity supports evaluation of visualization systems, recommendation of suitable views or tasks, guidance of interaction, and validation of analytical results. It enables researchers to understand how these visualization systems are used and to gain insight…
Conception et implémentation d'une ontologie des facteurs psychosociaux liés aux attitudes et comportements alimentaires dysfonctionnels chez les sportifs
Communication lors d'une conférence
Sara Taoufiq, Molka Tounsi Dhouib, Amandine Daubresse, Catherine Faron, Meggy Hayotte, Stéphanie Scoffier-Mériaux
Les attitudes et comportements alimentaires dysfonctionnels (ACAD) représentent des phénomènes complexes liés à de multiples facteurs psychosociaux dans le contexte sportif. Les recherches actuelles dans ce domaine présentent une forte complexité et des inconsistances…
Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
Communication lors d'une conférence
Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, André Nusser, Carolin Rehs
A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm runs in $O((nm)^2 \log(nm))$ time [Mount, Silverman, Wu 96], where $n$ and $m$…
Centered colorings in minor-closed graph classes
Communication lors d'une conférence
Jȩdrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud
A vertex coloring $φ$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$, either $φ$ uses more than $p$ colors on $H$, or there is a color that appears exactly once on $H$. We prove that for every fixed positive integer $t$, every $K_t$-minor-free graph…
Tensor Decompositions for Signal Processing: Theory, Advances, and Applications
Article dans une revue
Neriman Tokcan, Shakir Showkat Sofi, Van Tien Pham, Clémence Prévost, Sofiane Kharbech, Baptiste Magnier, Thanh Phuong Nguyen, Yassine Zniyed, Lieven de Lathauwer
In the era of big data, rapid advancements in technology and data collection methods have led to the generation and accessibility of vast amounts of multi-modal, high-dimensional data across a diverse range of disciplines. Tensor methods have emerged as essential tools in…