Ranking Cartesian Sums and K -maximum subarray problem
dc.contributor.author | Bae, Sung Eun | |
dc.contributor.author | Takaoka, Tadao | |
dc.date.accessioned | 2017-12-05T02:37:50Z | |
dc.date.available | 2017-12-05T02:37:50Z | |
dc.date.issued | 2006 | en |
dc.description.abstract | We 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.uri | http://hdl.handle.net/10092/14723 | |
dc.language | English | |
dc.language.iso | en | |
dc.publisher | University of Canterbury | en |
dc.rights | All Right Reserved | en |
dc.rights.uri | https://canterbury.libguides.com/rights/theses | en |
dc.title | Ranking Cartesian Sums and K -maximum subarray problem | en |
dc.type | Theses / Dissertations | en |
thesis.degree.grantor | University of Canterbury | en |
thesis.degree.level | Doctoral | en |
thesis.degree.name | Other | en |
uc.college | Faculty of Engineering | en |