|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
52616085
在线人数 :
709
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
显示项目 649721-649730 / 2348617 (共234862页)
<< < 64968 64969 64970 64971 64972 64973 64974 64975 64976 64977 > >>
每页显示[10|25|50]项目
| 國立臺灣科技大學 |
2004 |
Parallel algorithms for arbitrary dimensional Euclidean distance transforms with applications on arrays with reconfigurable optical buses
|
Wang, Y. R.;Horng, S. J. |
| 國立臺灣科技大學 |
2004-02 |
Parallel algorithms for arbitrary dimensional Euclidean distance transforms with applications on arrays with reconfigurable optical buses
|
Yuh-Rau Wang;Shi-Jinn Horng |
| 國立交通大學 |
2014-12-08T15:32:50Z |
PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
|
Hsu, F. R.; Chang, R. C.; Lee, R. C. T. |
| 國立政治大學 |
2002 |
Parallel algorithms for connected domination problem on interval and circular-arc graphs.
|
Hsu, F.R.; 沈錳坤; Shan, M.K. |
| 國立政治大學 |
2003-08 |
Parallel Algorithms for Finding the Center of Interval and Circular-Arc Graphs
|
許芳榮;沈錳坤 |
| 國立交通大學 |
2014-12-08T15:04:47Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立交通大學 |
2014-12-08T15:05:04Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立交通大學 |
2019-04-02T06:04:40Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立交通大學 |
2019-04-02T05:59:16Z |
PARALLEL ALGORITHMS FOR FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE
|
HSU, LH; WANG, PF; WU, CT |
| 國立臺灣科技大學 |
2003 |
Parallel algorithms for higher-dimensional Euclidean distance transforms with applications
|
Wang, Y. R.;Horng, S. J.;Lee, Y. H.;Lee, P. Z. |
显示项目 649721-649730 / 2348617 (共234862页)
<< < 64968 64969 64970 64971 64972 64973 64974 64975 64976 64977 > >>
每页显示[10|25|50]项目
|
