| 中華大學 |
2005 |
Computing subgraph probability of random geometric graphs: Quantitative analyses of wireless ad hoc networks
|
俞征武; Yu, Chang Wu |
| 國立臺灣大學 |
2004 |
Computing System Failure Frequencies and Reliability Importance Measures using OBDD
|
Chang, Yung-Ruei; Amari, S.V.; Kuo, Sy-Yen |
| 臺大學術典藏 |
2018-09-10T04:59:08Z |
Computing System Failure Frequencies and Reliability Importance Measures using OBDD
|
Y. R. Chang; S. V. Amari; S. Y. Kuo; SY-YEN KUO |
| 嘉南藥理大學 |
2009 |
Computing Systems in Engineering
|
Elsevier SDOL |
| 國立交通大學 |
2014-12-08T15:21:21Z |
Computing the Ball Size of Frequency Permutations under Chebyshev Distance
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:22:32Z |
Computing the ball size of frequency permutations under Chebyshev distance
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:05:22Z |
COMPUTING THE CONSTRAINED RELATIVE NEIGHBORHOOD GRAPHS AND CONSTRAINED GABRIEL GRAPHS IN EUCLIDEAN PLANE
|
SU, TH; CHANG, RC |
| 國立臺灣科技大學 |
1992 |
Computing the Convex Hull in a Hammock
|
Wang, Y. L.;Lee, R. C. T.;Chang, J. S. |
| 國立臺灣大學 |
1989 |
Computing the convex hull of a simple polygon
|
Chen, Chern-Lin |
| 淡江大學 |
2016 |
Computing the distribution of linear combinations of Laplace order statistics
|
李柏毅;Lee, Bo-Yi |
| 國立政治大學 |
2000 |
Computing the Eigenproblem of a Real Orthogonal Matrix
|
鄭月雯; Cheng, Yueh-Wen |
| 淡江大學 |
1996 |
Computing the exact distribution of the extremes of linear combinations of spacings
|
Huffer, Fred W. ; 林千代; Lin, C. T. |
| 淡江大學 |
1997-12-04 |
Computing the exact distribution of the extremes of sums of consecutive spacings
|
Huffer, Fred W.; 林千代; Lin, Chien-tai |
| 國立交通大學 |
2018-08-21T05:53:12Z |
Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations
|
Huang, Tsung-Ming; Lin, Wen-Wei; Tian, Heng; Chen, Guan-Hua |
| 臺大學術典藏 |
2020-05-04T07:56:37Z |
Computing the girth of a planar graph in linear time
|
HSUEH-I LU; Lu, H.-I.; Chang, H.-C.; Chang, H.-C.;Lu, H.-I. |
| 臺大學術典藏 |
2020-05-04T07:56:36Z |
Computing the girth of a planar graph in linear time
|
Chang, H.-C.;Lu, H.-I.; Chang, H.-C.; Lu, H.-I.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:39Z |
Computing the Girth of a Planar Graph in Linear Time
|
Chang, Hsien-Chih; Chang, Hsien-Chih;Lu, Hsueh-I.; Lu, Hsueh-I.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:40Z |
Computing the Girth of a Planar Graph in Linear Time.
|
Chang, Hsien-Chih;Lu, Hsueh-I; Chang, Hsien-Chih; Lu, Hsueh-I; HSUEH-I LU |
| 淡江大學 |
2001-10-01 |
Computing the joint distribution of general linear combinations of spacings or exponential variates
|
Huffer, F. W.; Lin, C. T. |
| 國立交通大學 |
2014-12-08T15:05:22Z |
COMPUTING THE K-RELATIVE NEIGHBORHOOD GRAPHS IN EUCLIDEAN PLANE
|
SU, TH; CHANG, RC |
| 臺大學術典藏 |
2016 |
Computing the line-constrained k-center in the plane for small k
|
KUN-MA0 CHAO; Huang, A.J.-H.; Wang, H.-L.; Chao, K.-M. |
| 亞洲大學 |
2008-01 |
Computing the modular inverses is as simple as computing the GCDs
|
Liu, CL (Liu, Chao-Liang); Horng, G (Horng, Gwoboa); Liu, HY (Liu, Hsin-Yu) |
| 亞洲大學 |
2008 |
Computing the modular inverses is as simple as computing the GCDs
|
Liu, Chao-Liang ; Horng, Gwoboa ; Liu, Hsin-Yu |
| 亞洲大學 |
2008-01 |
Computing the Modular Inverses Is as Simple as Computing the GCDs
|
劉兆樑;Liu, Chao-Liang |
| 國立交通大學 |
2014-12-08T15:45:11Z |
Computing the noncentral beta distribution with S-system
|
Chen, ZY; Chou, YC |
