Disjoint segments with maximum density

DOI10.1007/11428848_108MaRDI QIDQ5709403zbMATH OpenOpenAlexFDO

Authors Hsueh-I Lu, Chuan Yi Tang, Y. H. Chen

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136571

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• On locating disjoint segments with maximum sum of densities
• On Locating Disjoint Segments with Maximum Sum of Densities
• Algorithms for problems on maximum density segment
• An optimal algorithm for the maximum-density segment problem
• An Optimal Algorithm for the Maximum-Density Segment Problem

Cited in

(6)

• On locating disjoint segments with maximum sum of densities
• Excess in arrangements of segments
• Approximating the maximum consecutive subsums of a sequence
• Algorithms for problems on maximum density segment
• On Locating Disjoint Segments with Maximum Sum of Densities
• Fast algorithms for finding disjoint subsequences with extremal densities

This page was built for publication: Disjoint segments with maximum density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709403)