The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
We propose a method to detect the onset of linear trend in a time series and estimate the change point T from the profile of a linear trend test statistic, computed on consecutive...
This paper aims at estimating the switching time for linear switched systems, i.e. the time instant when a sub-model is switched on while another one is switched off. Assuming that...
Yang Tian, Thierry Floquet, Lotfi Belkoura, Wilfri...
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...