—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Abstract. DNA copy number is the number of replicates of a contiguous segment of DNA on the genome. Copy number alteration (CNA) is a genetic abnormality in which the number of the...
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....