Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Tong-Wook Shinn"'
Publikováno v:
Algorithms, Vol 10, Iss 1, p 5 (2017)
We present efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array. We deal with two MS problems; the maximum subarray (MSA) problem and the maximum convex sum (MCS)
Externí odkaz:
https://doaj.org/article/5b864c7e10cb4bac8378a30aa96da047
Autor:
Tong-Wook Shinn, Tadao Takaoka
Publikováno v:
Theoretical Computer Science. 575:10-16
We extend the well known bottleneck paths problem in two directions for directed graphs with unit edge costs and positive real edge capacities. Firstly we narrow the problem domain and compute the bottleneck of the entire network in O ( m log ? n ) t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85784c5b6ad098671025c74bb5ad7cf2
https://doi.org/10.1016/j.tcs.2014.10.049
https://doi.org/10.1016/j.tcs.2014.10.049
Publikováno v:
ICCS
Matrix multiplication is a fundamental mathematical operation that has numerous applications across most scientific fields. Cannon's distributed algorithm to multiply two n-by-n matrices on a two dimensional square mesh array with n2 cells takes exac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::313b6e4ebcbf50a4bf07784d1b5ec808
https://doi.org/10.1016/j.procs.2014.05.208
https://doi.org/10.1016/j.procs.2014.05.208
Publikováno v:
ACE/ACSC/AISC/APCMM/AUIC/AWC
In this paper, we present a parallel algorithm for the maximum convex sum (MCS) problem, which is a generalization of the maximum subarray (MSA) problem. In the MSA problem, we find a rectangular portion within the given data array that maximizes the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41a98f8bc04a4f0ef8847f2039a10299
https://doi.org/10.1145/2843043.2843049
https://doi.org/10.1145/2843043.2843049
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319487489
COCOA
COCOA
We break the long standing cubic time bound of \(O(n^3)\) for the Minimum Weight Polygon Triangulation problem by showing that the well known dynamic programming algorithm, reported independently by Gilbert and Klincsek, can be optimized with a faste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bc51072703618c31b616d9e54016dab
https://doi.org/10.1007/978-3-319-48749-6_24
https://doi.org/10.1007/978-3-319-48749-6_24
Autor:
Tong-Wook Shinn, Tadao Takaoka
Publikováno v:
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN
LATIN
We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4ebe7de4ce666d870e4b6bf8f838de7
https://doi.org/10.1007/978-3-642-54423-1_20
https://doi.org/10.1007/978-3-642-54423-1_20
Autor:
Tong-Wook Shinn, Tadao Takaoka
Publikováno v:
Algorithms and Computation ISBN: 9783319046563
WALCOM
WALCOM
We extend the well known bottleneck paths problem in two directions for directed unweighted graphs with positive real edge capacities. Firstly we narrow the problem domain and compute the bottleneck of the entire network in O(mlogn) time, where m and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe53a4dc68e071911a545b56cd1e386d
https://doi.org/10.1007/978-3-319-04657-0_18
https://doi.org/10.1007/978-3-319-04657-0_18