|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"lee rct"
Showing items 1-25 of 34 (2 Page(s) Totally)
1 2 > >>
View [10|25|50] records per page
| 國立交通大學 |
2019-04-02T05:59:06Z |
A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONS
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:40:20Z |
The full Steiner tree problem
|
Lu, CL; Tang, CY; Lee, RCT |
| 國立交通大學 |
2014-12-08T15:18:24Z |
The approximability of the weighted Hamiltonian path completion problem on a tree
|
Wu, Q; Lu, CL; Lee, RCT |
| 國立交通大學 |
2014-12-08T15:16:29Z |
Two-machine flow-shop scheduling to minimize total late work
|
Lin, BMT; Lin, FC; Lee, RCT |
| 國立交通大學 |
2014-12-08T15:06:23Z |
SYMBOLIC GRAY CODE AS A PERFECT MULTIATTRIBUTE HASHING SCHEME FOR PARTIAL MATCH QUERIES
|
CHANG, CC; LEE, RCT; DU, MW |
| 國立交通大學 |
2014-12-08T15:06:19Z |
THE HIERARCHICAL ORDERING IN MULTIATTRIBUTE FILES
|
CHANG, CC; DU, MW; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:18Z |
PERFORMANCE ANALYSES OF CARTESIAN PRODUCT FILES AND RANDOM FILES
|
CHANG, CC; DU, MW; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:17Z |
A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONS
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:17Z |
ON THE AVERAGE LENGTH OF DELAUNAY TRIANGULATIONS
|
CHANG, RC; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:17Z |
A PARALLEL ALGORITHM TO SOLVE THE STABLE MARRIAGE PROBLEM
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:17Z |
THE AVERAGE PERFORMANCE ANALYSIS OF A CLOSEST-PAIR ALGORITHM
|
CHANG, RC; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:16Z |
OPTIMAL SPEEDING UP OF PARALLEL ALGORITHMS BASED UPON THE DIVIDE-AND-CONQUER STRATEGY
|
TANG, CY; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:13Z |
A PARALLEL SORTING SCHEME WHOSE BASIC OPERATION SORTS N ELEMENTS
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:12Z |
AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE
|
CHANG, RC; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:05:47Z |
A SYSTOLIC ALGORITHM FOR EXTRACTING REGIONS FROM A PLANAR GRAPH
|
SHIH, ZC; LEE, RCT; YANG, SN |
| 國立交通大學 |
2014-12-08T15:05:39Z |
A PARALLEL ALGORITHM FOR FINDING CONGRUENT REGIONS
|
SHIH, ZC; LEE, RCT; YANG, SN |
| 國立交通大學 |
2014-12-08T15:05:32Z |
MINIMUM RECTANGULAR PARTITION PROBLEM FOR SIMPLE RECTILINEAR POLYGONS
|
LIOU, WT; TAN, JJM; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:05:23Z |
PASSWORD AUTHENTICATION USING NEWTON INTERPOLATING POLYNOMIALS
|
LIN, CH; CHANG, CC; WU, TC; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:05:02Z |
AMORTIZED ANALYSIS OF SOME DISK SCHEDULING ALGORITHMS - SSTF, SCAN, AND N-STEP SCAN
|
CHEN, TS; YANG, WP; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:04:48Z |
SPECIAL SUBGRAPHS OF WEIGHTED VISIBILITY GRAPHS
|
HSU, FR; LEE, RCT; CHANG, RC |
| 國立交通大學 |
2014-12-08T15:04:40Z |
THE SLAB DIVIDING APPROACH TO SOLVE THE EUCLIDEAN P-CENTER PROBLEM
|
HWANG, RZ; LEE, RCT; CHANG, RC |
| 國立交通大學 |
2014-12-08T15:04:34Z |
THE SEARCHING OVER SEPARATORS STRATEGY TO SOLVE SOME NP-HARD PROBLEMS IN SUBEXPONENTIAL TIME
|
HWANG, RZ; CHANG, RC; LEE, RCT |
| 國立暨南國際大學 |
2010 |
Data hiding methods based upon DNA sequences
|
李家同; Lee, RCT |
| 國立暨南國際大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
李家同; Lee, RCT |
| 國立暨南國際大學 |
2007 |
Reversible data hiding schemes for deoxyribonucleic acid (DNA) medium?
|
李家同; Lee, RCT |
Showing items 1-25 of 34 (2 Page(s) Totally)
1 2 > >>
View [10|25|50] records per page
|
