@inproceedings{d63a53e00f5245688db916295ded86f1,
title = "Optimum quantizing of monotonic nondecreasing arrays",
abstract = "This paper presents an efficient algorithm for finding the optimal k-cuts of a nondecreasing array of size n that produces the maximum area under the points. The na{\"i}ve approach uses a dynamic programming algorithm which requires O(kn2) time, where n is the size of the array. This algorithm is time consuming for large n or k and thus inappropriate. We design faster algorithms by discovering and proving some nice properties of the nondecreasing arrays, finding convex hull, and by continuous-to-discrete transformation. We believe that an O(kn) time algorithm exists and show a heuristic algorithm.",
keywords = "Maximum Area, Monotonic Nondecreasing Convex Arrays, Quantization",
author = "Hsu, {William W.Y.} and Lu, {Cheng Yu} and Ming-Yang Kao and Ho, {Jan Ming}",
year = "2013",
month = oct,
day = "28",
doi = "10.1109/CIFEr.2013.6611703",
language = "English (US)",
isbn = "9781467359214",
series = "Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013",
pages = "95--101",
booktitle = "Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013",
note = "2013 IEEE Conference on Computational Intelligence for Financial Engineering and Economics, CIFEr 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 ; Conference date: 16-04-2013 Through 19-04-2013",
}