22 search results - page 1 / 5 » Disjoint Segments with Maximum Density |
ICCS
2005
Springer
13 years 10 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...
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 4 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...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Publication
We present a region-based active contour approach to segmenting masses in digital mammograms. The algorithm developed in a Maximum Likelihood approach is based on the calculation o...