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…

INT CL A
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$…

INT CL
Toughness Properties of Arbitrarily Partitionable Graphs
Article dans une revue

Julien Bensmail

Drawing inspiration from a well-known conjecture of Chv\'atal on a toughness threshold guaranteeing graph Hamiltonicity, we investigate toughness properties of so-called arbitrarily partitionable (AP) graphs, which are those graphs that can be partitioned into arbitrarily many…

INT CL
Neighbor selection strategies in the wild for CDN/V2V WebRTC live streaming: Can we learn what a good neighbor is?
Article dans une revue

Zhejiayu Ma, Frédéric Giroire, Guillaume Urvoy-Keller, Soufiane Rouibia

A hybrid CDN/Viewer-to-Viewer (V2V) architecture is an attractive solution for HTTP (HLS) and MPEG-DASH-based live streaming providers. It combines a traditional CDN with a V2V overlay for exchanging video fragments, reducing the CDN costs while maintaining the quality of…

INT CL
The Harmonious Coloring Game
Article dans une revue

Cláudia Linhares Sales, Thiago Marcilon, Nicolas Martins, Nicolas Nisse, Rudini Sampaio

A harmonious k-coloring of a graph G is a 2-distance proper k-coloring of its vertices such that each edge is uniquely identified by the colors of its endpoints. Here, we introduce its game version: the harmonious coloring game. In this two-player game, Alice and Bob…

INT CL
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…

INT CL
Toutes les publications i3S (sur le site HAL)