 | 2011 |
|---|
| 13 |       | Yu-Kumg Chen,
Fan-Chieh Cheng,
Pohsiang Tsai:
A gray-level clustering reduction algorithm with the least PSNR.
Expert Syst. Appl. 38(8): 10183-10187 (2011) |
| 12 | | Yu-Kumg Chen,
Chen-An Fang,
Fan-Chieh Cheng:
An Optimal Algorithm for Solving the Towers of Hanoi Problem with the Least Storage Used.
IEICE Transactions 94-D(2): 240-242 (2011) |
| 2009 |
|---|
| 11 | | Fan-Chei Cheng,
Yu-Kumg Chen,
Kuan-Ting Liu:
An Efficient Gray-level Clustering Algorithm for Image Segmentation.
CAR 2009: 259-262 |
| 10 | | Yu-Kumg Chen,
Tung-Yi Cheng,
Shuo-Tsung Chiu:
Motion Detection with Entropy in Dynamic Background.
CAR 2009: 263-266 |
| 2008 |
|---|
| 9 | | Fan-Chei Cheng,
Yu-Kumg Chen:
Effective Sigma-Delta Background Estimation for Video Background Generation.
APSCC 2008: 1315-1321 |
| 8 | | Shuo-Yan Chou,
Chang-Chien Chou,
Yu-Kumg Chen:
A base function for generating contour traversal paths in stereolithography apparatus applications.
Expert Syst. Appl. 35(1-2): 235-244 (2008) |
| 2007 |
|---|
| 7 | | Chang-Chien Chou,
Yu-Kumg Chen,
Shuo-Yan Chou:
Shortest Traversal Path of n Circles in Layered Manufacturing Applications.
CGIV 2007: 205-210 |
| 2006 |
|---|
| 6 | | Yu-Kumg Chen,
Yi-Fan Chang:
Two Thresholding for Deriving the Bi-level Document Image.
PSIVT 2006: 228-237 |
| 2004 |
|---|
| 5 | | Yu-Ting Pai,
Yu-Kumg Chen:
The Fastest Carry Lookahead Adder.
DELTA 2004: 434-436 |
| 2003 |
|---|
| 4 |  | Yu-Kumg Chen,
Shuo-Yan Chou:
Simulating surface finishing for process design.
ISPE CE 2003: 899-907 |
| 3 | | Yu-Kumg Chen:
Optimal regular polygon inclusion in two-dimensional space for evaluating material nesting.
ISPE CE 2003: 909-917 |
| 2 | | Yu-Kumg Chen,
K. Y. Hwang,
C. W. Sun:
Optimal replenishment schedule considering time value for logistic demand.
ISPE CE 2003: 937-946 |
| 2001 |
|---|
| 1 | | Yu-Kumg Chen,
Shuo-Yan Chou,
Tzong-Chen Wu:
An Efficient Method for Computing the Feasible Region with Translational Containment between Two Convex Polygons.
ICDCS Workshops 2001: 390-395 |
Data released under the ODC-BY 1.0 license — See also our legal information page