315 search results - page 1 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
CORR
2002
Springer
13 years 5 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...
ICCS
2005
Springer
13 years 11 months ago
2005
Springer
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
EVOW
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
3DPVT
2004
IEEE
13 years 9 months ago
2004
IEEE
We present a formulation of boundary mesh segmentation as an optimization problem. Previous segmentation solutions are classified according to the different segmentation goals, th...