Marteau, Pierre-François

A method called iTEKA, which stands for iterative time elastic kernel averaging, was successfully used for averaging time series. \mbox{In this paper}, we adapt it to GPS trajectories. The key contribution is a denoising procedure that includes an over-sampling scheme, the detection and removal of outlier trajectories, a kernelized time elastic ave...

Neto, José Ben-Ameur, Walid

Given an undirected graph, a minimum cut cover is a collection of cuts covering the whole set of edges and having minimum cardinality. This paper is dedicated to the fractional version of this problem where a fractional weight is computed for each cut such that, for each edge, the sum of the weights of all cuts containing it is no less than 1, whil...

Bousquet, Nicolas Lochet, William Thomassé, Stéphan

A very nice result of Bárány and Lehel asserts that every finite subset X or can be covered by X-boxes (i.e. each box has two antipodal points in X). As shown by Gyárfás and Pálvőlgyi this result would follow from the following conjecture: If a tournament admits a partition of its arc set into k quasi-orders, then its domination number is bounded i...

Meyer, Luc Ichalal, Dalil Vigneron, Vincent

This paper investigates the construction of an estimator for switching linear systems with unknown inputs (UI) and Gaussian noises, in the case of unknown switching sequence. First, a maximum-likelihood switching sequence estimator is constructed. Then, both state and UI estimators are proposed. An example illustrates the theoretical contributions....

Barceló, Pablo Figueira, Diego Romero, Miguel

We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a corollary, when ...

Barceló, Pablo Figueira, Diego Romero, Miguel

We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a corollary, when ...

Neto, José Ben-Ameur, Walid

Given an undirected graph, a minimum cut cover is a collection of cuts covering the whole set of edges and having minimum cardinality. This paper is dedicated to the fractional version of this problem where a fractional weight is computed for each cut such that, for each edge, the sum of the weights of all cuts containing it is no less than 1, whil...

Flores-Luyo, Luis Agra, Agostinho Figueiredo, Rosa Ocana, Eladio

We study a routing-collecting problem where a system of stations is considered. A vehicle is responsible for collecting information generated continuously in the stations and to deliver it to the base station. The objective is to determine the vehicle route and the collection operations, both physical and wireless, in order to maximize the amount o...

Barceló, Pablo Figueira, Diego Romero, Miguel

We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a corollary, when ...

Ducoffe, Guillaume Marinescu-Ghemeci, Ruxandra Popa, Alexandru

The (directed) proper connection number of a given (di)graph G is the least number of colors needed to edge-color G such that there exists a properly colored (di)path between every two vertices in G. There also exist vertex-coloring versions of the proper connection number in (di)graphs. We initiate the study of the complexity of computing the prop...