Sung Eun Bae
University of Canterbury
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Sung Eun Bae.
international symposium on parallel architectures algorithms and networks | 2004
Sung Eun Bae; Tadao Takaoka
Given an array of positive and negative values, we consider the problem of K maximum sums. When an overlapping property needs to be observed, previous algorithms for the maximum sum are not directly applicable. We designed an O(K * n) algorithm for the K maximum subsequences problem. This was then modified to solve the K maximum subarrays problem in O(K * n/sup 3/) time. Finally, we present a VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.
The Computer Journal | 2006
Sung Eun Bae; Tadao Takaoka
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, Bengtsson and Chen presented
computing and combinatorics conference | 2005
Sung Eun Bae; Tadao Takaoka
international conference on computational science | 2006
Sung Eun Bae; Tadao Takaoka
O\left(\mathit{min}\right\{K+n{\hbox{ log }}^{2}n,n\sqrt{K}\left\}\right)
international conference on conceptual structures | 2014
Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka
international symposium on algorithms and computation | 2007
Sung Eun Bae; Tadao Takaoka
time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays in sorted order with improved complexity of O ((n + K) log K). For the two-dimensional case, we introduce two techniques that establish O(n3) and subcubic time.
Algorithms | 2017
Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to find the K subarrays with largest sums. We improve the time complexity for the one-dimensional case from
conference on combinatorial optimization and applications | 2016
Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka
O(min\{K+n\log^2 n, n\sqrt{K}\})
Proceedings of the Australasian Computer Science Week Multiconference on | 2016
Sung Eun Bae; Tong-Wook Shinn; Tadao Takaoka
for 0 ≤ K ≤ n(n–1)/2 to O(nlog K + K2) for K ≤ n. The latter is better when
International Journal of Foundations of Computer Science | 2007
Sung Eun Bae; Tadao Takaoka
K \le \sqrt n\log n