Skip to main content
Article thumbnail
Location of Repository

By 

Abstract

www.elsevier.com/locate/ipl Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint Kuan-Yu Chen a, Kun-Mao Chao a,b,

Topics: Sequence analysis, Longest segment, Shortest segment, Algorithms
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9723
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.csie.ntu.edu.tw/~km... (external link)
  • www.elsevier.com/locate/ipl (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.