-
Complexity of greedy edge-colouring
The Grundy index of a graph G = (V,E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining... -
Locally Adaptive Greedy Approximations for Anisotropic Parameter Reduced Basi...
Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line... -
Random time-frequency Subdictionary design for sparse representation with gre...
International audience -
SCOOP: A Real-Time Sparsity Driven People Localization Algorithm
International audience -
Some Rates of Convergence for the Selected Lasso Estimator
International audience -
Minimum Dissatisfaction Personnel Scheduling
Some of the algorithmic techniques presented in this paper were later used by the first author for developing solutions to several algorithmic contest tasks (see the attached... -
Computing efficiently the lattice width in any dimension
International audience -
Sparse and herarchical representations for archival and compression of audio ...
The main goal of this work is automated processing of large volumes of audio data. Most specifically, one is interested in archiving, a process that encompass at least... -
On the greedy walk problem
International audience -
Frequency assignment in a SDMA satellite communication system with beam decen...
International audience -
Cost-Optimal Execution of Trees of Boolean Operators with Shared Streams
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor... -
An evaluation of the sparsity degree for sparse recovery with deterministic m...
International audience -
Approximation of greedy algorithms for Max-ATSP, Maximal Compression, and Sho...
Given a directed graph G with weights on its arcs, the Maximum Asymmetric Travelling Salesman Problem (Max- ATSP) asks for a Hamiltonian path of maximum weight... -
Graph coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to... -
Sparse Blind Deconvolution in Ultrasound Imaging Using an Adaptive CLEAN Algo...
The ultrasonic imaging knows a continuous advance in the aspect of increasing the resolution for helping physicians to better observe and distinguish the examined... -
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square...
International audience -
Similarity measures between generalized maps
A generalized map is a topological model that allows to represent implicitly differenttypes of cells (vertices, edges, volumes, . . . ) and their relationship by using...
