85 search results - page 2 / 17 » Optimal Blurred Segments Decomposition in Linear Time |
ICDM
2005
IEEE
13 years 12 months ago
2005
IEEE
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...
CPM
2006
Springer
13 years 10 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
WISE
2005
Springer
13 years 12 months ago
2005
Springer
Web sites, Web pages and the data on pages are available only for specific periods of time and are deleted afterwards from a client’s point of view. An important task in order t...
FOCS
1991
IEEE
13 years 9 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
CORR
2002
Springer
13 years 6 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...