Ranking Cartesian Sums and K -maximum subarray problem

Simple item page
dc.contributor.authorBae, Sung Eun
dc.contributor.authorTakaoka, Tadao
dc.date.accessioned2017-12-05T02:37:50Z
dc.date.available2017-12-05T02:37:50Z
dc.date.issued2006en
dc.description.abstractWe design a simple algorithm that ranks K largest in Cartesian sums X + Y in O(m + K log K ) time. Based on this, K -maximum subarrays can be computed in O(n + K log K ) time (1D) and O(n3 + K log K ) time (2D) for input array of size n and n × n respectively.en
dc.identifier.urihttp://hdl.handle.net/10092/14723
dc.languageEnglish
dc.language.isoen
dc.publisherUniversity of Canterburyen
dc.rightsAll Right Reserveden
dc.rights.urihttps://canterbury.libguides.com/rights/thesesen
dc.titleRanking Cartesian Sums and K -maximum subarray problemen
dc.typeTheses / Dissertationsen
thesis.degree.grantorUniversity of Canterburyen
thesis.degree.levelDoctoralen
thesis.degree.nameOtheren
uc.collegeFaculty of Engineeringen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
tr_0603.pdf
Size:
101.17 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Engineering: Reports