Tai-Ching Tuan

According to our database, Tai-Ching Tuan authored at least 15 papers between 1990 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Compact Neural Architecture Designs by Tensor Representations.

Jiahao Su, Jingling Li, Xiaoyu Liu, Teresa M. Ranadive, Christopher J. Coley, Tai-Ching Tuan, Furong Huang

Frontiers Artif. Intell., 2022

2019

Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale.

James R. Ezick, Ben Parsons, William Glodek, Tom Henretty, Muthu Manikandan Baskaran, Richard Lethin, John Feo, Tai-Ching Tuan, Christopher J. Coley, Leslie Leonard, Rajeev Agrawal

Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2016

Optimizing Sparse Matrix-Vector Multiplication for Large-Scale Data Analytics.

Daniele Buono, Fabrizio Petrini, Fabio Checconi, Xing Liu, Xinyu Que, Chris Long, Tai-Ching Tuan

Proceedings of the 2016 International Conference on Supercomputing, 2016

2015

Optimizing Sparse Linear Algebra for Large-Scale Graph Analytics.

Daniele Buono, John A. Gunnels, Xinyu Que, Fabio Checconi, Fabrizio Petrini, Tai-Ching Tuan, Chris Long

Computer, 2015

1999

Uni-directional Alternating Group Graphs.

Jung-Sing Jwo, Tai-Ching Tuan

J. Inf. Sci. Eng., 1999

1998

On container length and connectivity in unidirectional hypercubes.

Jung-Sing Jwo, Tai-Ching Tuan

Networks, 1998

1995

Uni-directional Alternating Group Graphs.

Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph.

Jung-Sing Jwo, Tai-Ching Tuan

Inf. Process. Lett., 1994

1992

On Optimal Single Jog River Routing.

Tai-Ching Tuan

IEEE Trans. Computers, 1992

An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1992

1991

On river routing with minimum number of jogs.

Tai-Ching Tuan, Kim-Heng Teo

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1991

A Tight Upper Bound for the Number of Intersections Between two Rectangular Paths.

Kim-Heng Teo, Tai-Ching Tuan

BIT, 1991

1990

River Routing with a Small Number of Jogs.

Tai-Ching Tuan, S. Louis Hakimi

SIAM J. Discret. Math., 1990

Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing.

Kim-Heng Teo, Tai-Ching Tuan

Inf. Process. Lett., 1990