Ranking Cartesian Sums and K-maximum subarrays

Simple item page
dc.contributor.authorBae, Sung Eun
dc.contributor.authorTakaoka, T.
dc.date.accessioned2009-10-26T20:41:19Z
dc.date.available2009-10-26T20:41:19Z
dc.date.issued2006en
dc.descriptionTR-COSC 03/08en
dc.description.abstractWe design a simple algorithm that ranks K largest in Cartesian sums X + Y in O(m + K logK) time. Based on this, K-maximum subarrays can be computed in O(n+K logK) time (1D) and O(n3 +K logK) time (2D) for input array of size n and n × n respectively.en
dc.identifier.citationBae, S.E., Takaoka, T. (2006) Ranking Cartesian Sums and K-maximum subarrays. 9pp.en
dc.identifier.urihttp://hdl.handle.net/10092/3020
dc.language.isoen
dc.publisherDepartment of Computer Science and Software Engineering, University of Canterburyen
dc.publisherUniversity of Canterbury. Computer Science and Software Engineeringen
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectCartesian sumsen
dc.subjectK-maximum subarraysen
dc.subject.marsdenFields of Research::280000 Information, Computing and Communication Sciencesen
dc.subject.marsdenFields of Research::280000 Information, Computing and Communication Sciences::280400 Computation Theory and Mathematics::280401 Analysis of algorithms and complexityen
dc.titleRanking Cartesian Sums and K-maximum subarraysen
dc.typeReports
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
12618833_tr_0603.pdf
Size:
101.17 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Reports