Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Takaoka, Tadao
72  Ergebnisse:
Personensuche X
?
1

Algebraic theory on shortest paths for all flows:

Takaoka, Tadao
Theoretical Computer Science.  774 (2019)  - p. 124-132 , 2019
Link: https://doi.org/10.1016/..
 
?
2

Efficient Algorithms for the Maximum Sum Problems:

Bae, Sung ; Shinn, Tong-Wook ; Takaoka, Tadao
Algorithms.  10 (2017)  1 - p. 5 , 2017
Link: https://doi.org/10.3390/..
 
?
3

An O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs short..:

Han, Yijie ; Takaoka, Tadao
Journal of Discrete Algorithms.  38-41 (2016)  - p. 9-19 , 2016
Link: https://doi.org/10.1016/..
 
?
4

An efficient parallel algorithm for the maximum convex sum ..:

, In: Proceedings of the Australasian Computer Science Week Multiconference,
Bae, Sung Eun ; Shinn, Tong-Wook ; Takaoka, Tadao - p. 1-7 , 2016
Link: https://dl.acm.org/doi/1..
 
?
5

Variations on the bottleneck paths problem:

Shinn, Tong-Wook ; Takaoka, Tadao
Theoretical Computer Science.  575 (2015)  - p. 10-16 , 2015
Link: https://doi.org/10.1016/..
 
?
6

A Faster Parallel Algorithm for Matrix Multiplication on a ..:

Bae, Sung Eun ; Shinn, Tong-Wook ; Takaoka, Tadao
Procedia Computer Science.  29 (2014)  - p. 2230-2240 , 2014
Link: https://doi.org/10.1016/..
 
?
7

Sharing information for the all pairs shortest path problem:

Takaoka, Tadao
Theoretical Computer Science.  520 (2014)  - p. 43-50 , 2014
Link: https://doi.org/10.1016/..
 
?
8

Application of the Maximum Convex Sum Algorithm in Determin..:

Thaher, Mohammed ; Umar, Danladi ; Takaoka, Tadao.
Procedia Computer Science.  18 (2013)  - p. 909-918 , 2013
Link: https://doi.org/10.1016/..
 
?
9

A simplified algorithm for the all pairs shortest path prob..:

Takaoka, Tadao
Journal of Combinatorial Optimization.  25 (2012)  2 - p. 326-337 , 2012
Link: https://doi.org/10.1007/..
 
?
10

Improved algorithms for the K overlapping maximum convex su..:

Thaher, Mohammed ; Takaoka, Tadao
Procedia Computer Science.  9 (2012)  - p. 754-763 , 2012
Link: https://doi.org/10.1016/..
 
?
11

An efficient algorithm for computing the K-overlapping maxi..:

Thaher, Mohammed ; Takaoka, Tadao
Procedia Computer Science.  4 (2011)  - p. 1288-1295 , 2011
Link: https://doi.org/10.1016/..
 
?
12

Entropy as Computational Complexity:

Takaoka, Tadao ; Nakagawa, Yuji
Journal of Information Processing.  18 (2010)  - p. 227-241 , 2010
Link: https://doi.org/10.2197/..
 
?
13

An efficient algorithm for the k maximum convex sums:

Thaher, Mohammed ; Takaoka, Tadao
Procedia Computer Science.  1 (2010)  1 - p. 1475-1483 , 2010
Link: https://doi.org/10.1016/..
 
?
14

All Pairs Shortest Paths via Matrix Multiplication: 2002; Z..:

, In: Encyclopedia of Algorithms,
Takaoka, Tadao - p. 31-34 , 2008
Link: https://doi.org/10.1007/..
 
?
15

Solving shortest paths efficiently on nearly acyclic direct..:

Saunders, Shane ; Takaoka, Tadao
Theoretical Computer Science.  370 (2007)  1-3 - p. 94-109 , 2007
Link: https://doi.org/10.1016/..
 
1-15