85 search results - page 1 / 17 » Optimal Blurred Segments Decomposition in Linear Time |
CG
2006
Springer
13 years 5 months ago
2006
Springer
Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12;...
DGCI
2005
Springer
13 years 11 months ago
2005
Springer
WG
1998
Springer
13 years 9 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
—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 ...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
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...