Authors:
TSAI HR
HORNG SJ
TSAI SS
LEE SS
KAO TW
CHEN CH
Citation: Hr. Tsai et al., OPTIMAL SPEED-UP PARALLEL IMAGE TEMPLATE MATCHING ALGORITHMS ON PROCESSOR ARRAYS WITH A RECONFIGURABLE BUS SYSTEM, Computer vision and image understanding (Print), 71(3), 1998, pp. 393-412
Citation: Wj. Tsaur et Sj. Horng, A NEW GENERALIZED SOFTWARE COMPLEXITY METRIC FOR DISTRIBUTED PROGRAMS, Information and software technology, 40(5-6), 1998, pp. 259-269
Citation: Yh. Lee et al., PARALLEL COMPUTATION OF THE EUCLIDEAN DISTANCE TRANSFORM ON THE MESH OF TREES AND THE HYPERCUBE COMPUTER, Computer vision and image understanding, 68(1), 1997, pp. 109-119
Citation: Fs. Jiang et al., EMBEDDING OF GENERALIZED FIBONACCI CUBES IN HYPERCUBES WITH FAULTY NODES, IEEE transactions on parallel and distributed systems, 8(7), 1997, pp. 727-737
Citation: Hr. Tsai et al., SOLVING AN ALGEBRAIC PATH PROBLEM AND SOME RELATED GRAPH PROBLEMS ON A HYPER-BUS BROADCAST NETWORK, IEEE transactions on parallel and distributed systems, 8(12), 1997, pp. 1226-1235
Citation: Ss. Lee et al., IMAGE-PROCESSING ON A RECONFIGURABLE ARRAY OF PROCESSORS WITH WIDER BUS NETWORKS, Pattern recognition, 30(9), 1997, pp. 1521-1532
Citation: Hr. Tsai et al., PARALLEL HIERARCHICAL-CLUSTERING ALGORITHMS ON PROCESSOR ARRAYS WITH A RECONFIGURABLE BUS SYSTEM, Pattern recognition, 30(5), 1997, pp. 801-815
Citation: Yh. Lee et Sj. Horng, THE EQUIVALENCE OF THE CHESSBOARD DISTANCE TRANSFORM AND THE MEDIAL AXIS TRANSFORM, International journal of computer mathematics, 65(3-4), 1997, pp. 165-177
Citation: Sj. Horng, GENERALIZED MESH-CONNECTED COMPUTERS WITH HYPERBUS BROADCASTING FOR ACOMPUTER NETWORK, IEICE transactions on information and systems, E79D(8), 1996, pp. 1107-1115
Citation: Hr. Tsai et al., PARALLEL SORTING ALGORITHMS ON A HYPER-CHANNEL BROADCAST COMMUNICATION MODEL, International journal of high speed computing, 8(4), 1996, pp. 307-318
Citation: Tw. Kao et al., CONSTANT-TIME ALGORITHMS FOR GRAPH CONNECTIVITY PROBLEMS ON RECONFIGURABLE MESHES USING FEWER PROCESSORS, International journal of high speed computing, 8(4), 1996, pp. 371-385
Citation: Ss. Lee et al., OPTIMAL COMPUTING HOUGH TRANSFORM ON A RECONFIGURABLE ARRAY OF PROCESSORS WITH WIDER BUS NETWORKS, Pattern recognition, 29(4), 1996, pp. 603-613
Citation: Tw. Kao et al., DESIGNING EFFICIENT PARALLEL ALGORITHMS ON CRAP, IEEE transactions on parallel and distributed systems, 6(5), 1995, pp. 554-560
Citation: Tw. Kao et Sj. Horng, OPTIMAL-ALGORITHMS FOR COMPUTING ARTICULATION POINTS AND SOME RELATEDPROBLEMS ON A CIRCULAR-ARC GRAPH, Parallel computing, 21(6), 1995, pp. 953-969
Citation: Cf. Lin et al., GENERALIZED ROTATE SORT ON MESH-CONNECTED COMPUTERS WITH MULTIPLE BROADCASTING USING FEWER PROCESSORS, International journal of high speed computing, 7(4), 1995, pp. 515-530
Citation: Tw. Kao et al., AN O(1) TIME ALGORITHMS FOR COMPUTING HISTOGRAM AND HOUGH TRANSFORM ON A CROSS-BRIDGE RECONFIGURABLE ARRAY OF PROCESSORS, IEEE transactions on systems, man, and cybernetics, 25(4), 1995, pp. 681-687
Citation: Tw. Kao et Sj. Horng, EFFICIENT ALGORITHMS FOR COMPUTING 2 NEAREST-NEIGHBOR PROBLEMS ON A RAP, Pattern recognition, 27(12), 1994, pp. 1707-1716