Computational Science – ICCS 2005

DOI10.1007/B136571zbMATH Open1106.68397OpenAlexW4206638761MaRDI QIDQ5709403FDOQ5709403

Authors: Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang 

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

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited In (6)

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

This page was built for publication: Computational Science – ICCS 2005

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