315 search results - page 4 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
CCCG
2007
14 years 11 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
67
Voted
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
SIBGRAPI
2008
IEEE
15 years 3 months ago
2008
IEEE
Recently, a new Pattern Recognition technique based on straight line segments (SLSs) was presented. The key issue in this new technique is to find a function based on distances b...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
MVA
1998
14 years 11 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...