Authors: SUM J CHAN LW LEUNG CS YOUNG GH

Citation: J. Sum et al., EXTENDED KALMAN FILTER-BASED PRUNING METHOD FOR RECURRENT NEURAL NETWORKS, Neural computation, 10(6), 1998, pp. 1481-1505

Authors: LI KQ PAN Y SHEN H YOUNG GH ZHENG SQ

Citation: Kq. Li et al., LOWER BOUNDS FOR DYNAMIC TREE EMBEDDING IN BIPARTITE NETWORKS, Journal of parallel and distributed computing (Print), 53(2), 1998, pp. 119-143

Authors: SHEN H LI K PAN Y YOUNG GH ZHENG SQ

Citation: H. Shen et al., PERFORMANCE ANALYSIS FOR DYNAMIC TREE EMBEDDING IN K-PARTITE NETWORKSBY A RANDOM-WALK, Journal of parallel and distributed computing, 50(1-2), 1998, pp. 144-156

Authors: LEUNG JYT TAM TW WONG CS YOUNG GH

Citation: Jyt. Leung et al., MINIMIZING MEAN FLOW TIME WITH ERROR CONSTRAINT, Algorithmica, 20(1), 1998, pp. 101-118

Authors: LEUNG JYT TAM TW YOUNG GH

Citation: Jyt. Leung et al., ONLINE ROUTING OF REAL-TIME MESSAGES, Journal of parallel and distributed computing, 34(2), 1996, pp. 211-217

Authors: LEUNG JYT TAM TW WONG CS YOUNG GH

Citation: Jyt. Leung et al., ROUTING MESSAGES WITH RELEASE TIME AND DEADLINE CONSTRAINTS, Journal of parallel and distributed computing, 31(1), 1995, pp. 65-76