English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27308/39152
Visitors : 2451435      Online Users : 51
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43777

Title: Optimum quantizing of monotonic nondecreasing arrays
Authors: William Wei-Yuan Hsu
Cheng-Yu Lu
Ming-Yang Kao
Jan-Ming Ho
Contributors: 國立臺灣海洋大學:資訊工程學系
NTOU:Department of Computer Science and Engineering
Keywords: Monotonic Nondecreasing Convex Arrays
Maximum Area
Date: 2013
Issue Date: 2017-10-31T08:53:03Z
Publisher: in 2013 IEEE Symposium on Computational Intelligence for Financial Engineering & Economics (CIFEr)
Abstract: 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ï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.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/43777
Appears in Collections:[資訊工程學系] 演講及研討會

Files in This Item:

File Description SizeFormat
06611703.pdf242KbAdobe PDF23View/Open

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback