Calculating a linear-time solution to the densest-segment problem. (14th December 2015)
- Record Type:
- Journal Article
- Title:
- Calculating a linear-time solution to the densest-segment problem. (14th December 2015)
- Main Title:
- Calculating a linear-time solution to the densest-segment problem
- Authors:
- CURTIS, SHARON
MU, SHIN-CHENG - Abstract:
- Abstract: The problem of finding a densest segment of a list is similar to the well-known maximum segment sum problem, but its solution is surprisingly challenging. We give a general specification of such problems, and formally develop a linear-time online solution, using a sliding-window style algorithm. The development highlights some elegant properties of densities, involving partitions that are decreasing and all right-skew.
- Is Part Of:
- Journal of functional programming. Volume 25(2015)
- Journal:
- Journal of functional programming
- Issue:
- Volume 25(2015)
- Issue Display:
- Volume 25, Issue 2015 (2015)
- Year:
- 2015
- Volume:
- 25
- Issue:
- 2015
- Issue Sort Value:
- 2015-0025-2015-0000
- Page Start:
- Page End:
- Publication Date:
- 2015-12-14
- Subjects:
- Functional programming (Computer science) -- Periodicals
- Journal URLs:
- http://journals.cambridge.org/action/displayJournal?jid=JFP ↗
http://firstsearch.oclc.org ↗ - DOI:
- 10.1017/S095679681500026X ↗
- Languages:
- English
- ISSNs:
- 0956-7968
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library STI - ELD Digital store
- Ingest File:
- 633.xml