Sciweavers

4315 search results - page 38 / 863
» Sorting in linear time
Sort
View
SWAT
2004
Springer
123views Algorithms» more  SWAT 2004»
15 years 8 months ago
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension
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...
SIMPRA
2011
14 years 9 months ago
Estimation of linear trend onset in time series
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...
Vafeiadis Thanasis, Bora-Senta Efthimia, Kugiumtzi...
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 21 days ago
Switching time estimation for linear switched systems: an algebraic approach
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...
ACL
2012
13 years 5 months ago
Heuristic Cube Pruning in Linear Time
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...
Andrea Gesmundo, Giorgio Satta, James Henderson
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 8 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
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...
Daniel Lemire, Martin Brooks, Yuhong Yan