Now showing items 1-8 of 8

    • Algorithms for K disjoint maximum subarrays 

      Sung, S.B.; Takaoka, T. (University of Canterbury. Computer Science and Software Engineering., 2006)
      The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O(n) time solution for one-dimension. This solution is, ...
    • Combinatorial Generation by Fusing Loopless Algorithms 

      Takaoka, T.; Violich, S. (University of Canterbury. Computer Science and Software Engineering., 2007)
      Some combinatorial generation problems can be broken down into subproblems for which loopless algorithms already exist. We discuss means by which existing loopless algorithms for subproblems can be combined or fused to ...
    • Combinatorial generation by fusing loopless algorithms 

      Takaoka, T.; Violich, S. (University of Canterbury. Computer Science and Software Engineering., 2006)
      Some combinatorial generation problems can be bro- ken into subproblems for which loopless algorithms already exist. We discuss means by which loop- less algorithms can be fused to produce a new loop- less algorithm ...
    • Improved Algorithms for the K-Maximum Subarray Problem 

      Bae, S.E.; Takaoka, T. (University of Canterbury. Computer Science and Software Engineering., 2006)
      The maximum subarray problem is to find the contiguous array elements having the largest possible sum. We extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allowed, ...
    • Investigation of the Maximum Association for Suicide Rate and Social Factors Using Computer Algorithm 

      Fukuda, K.; Takaoka, T. (University of Canterbury. Computer Science and Software Engineering., 2007)
      A computer algorithm, the K-Maximum Subarray (K-MSA), is applied for the first time to investigate the maximum relationship between the total New Zealand population of suicide deaths (1983-2002) by age group, with ...
    • Maximum subarray algorithms for use in astronomical imaging 

      Weddell, S.J.; Read, T.; Thaher, M.; Takaoka, T. (University of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Electrical and Computer Engineering, 2013)
      The maximum subarray problem is used to identify the subarray of a two-dimensional array, where the sum of elements is maximized. In terms of image processing, the solution has been used to find the brightest region within ...
    • A new public-key cryptosystem and its applications 

      Kiriyama, A.; Nakagawa, Y.; Takaoka, T.; Tu, Z. (University of Canterbury. Computer Science and Software Engineering., 2006)
      We propose in this paper a new public-key crypto-system, called the non-linear knapsack cryptosystem. The security of this system is based on the NP-completeness of the non-linear knapsack problem. We extend the system ...
    • Ranking Cartesian Sums and K-maximum subarrays 

      Bae, S.E.; Takaoka, T. (Department of Computer Science and Software Engineering, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 2006)
      We 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 ...