| 2008 |
|---|
| 16 | EE | Yih-Jeng Lin,
Ming-Shing Yu,
Chin-Yu Lin,
Yuan-Tsun Lin:
A Multi-layered Approach to the Polysemy Problems in a Chinese to Taiwanese System.
SUTC 2008: 428-435 |
| 2006 |
|---|
| 15 | EE | Ming-Shing Yu,
Feng-Long Huang,
Piyu Tsai:
Statistical Behavior Analysis of Smoothing Methods for Language Models of Mandarin Data Sets.
AIRS 2006: 172-186 |
| 2003 |
|---|
| 14 | EE | Ming-Shing Yu,
Feng-Long Huang:
Disambiguating the senses of non-text symbols for Mandarin TTS systems with a three-layer classifier.
Speech Communication 39(3-4): 191-229 (2003) |
| 2001 |
|---|
| 13 | EE | Yih-Jeng Lin,
Ming-Shing Yu:
Extracting Chinese Frequent Strings Without Dictionary From a Chinese corpus, its Applications.
J. Inf. Sci. Eng. 17(5): 805-824 (2001) |
| 2000 |
|---|
| 12 | | Neng-Huang Pan,
Wen-Tsai Jen,
Shyr-Shen Yu,
Ming-Shing Yu,
Shyh-Yang Hwang,
Ming-Jer Wu:
Prosody Model in a Mandarin Text-to-Speech System based on a Hierarchical Approach.
IEEE International Conference on Multimedia and Expo (I) 2000: 448-451 |
| 1998 |
|---|
| 11 | EE | Chuan-Ming Liu,
Ming-Shing Yu:
An Optimal Parallel Algorithm for Node Ranking of Cographs.
Discrete Applied Mathematics 87(1-3): 187-201 (1998) |
| 10 | EE | Yue-Li Wang,
Kuo-Ching Chiang,
Ming-Shing Yu:
Optimal Algorithms for Interval Graphs.
J. Inf. Sci. Eng. 14(2): 449-459 (1998) |
| 1993 |
|---|
| 9 | | Ming-Shing Yu,
Cheng-Hsing Yang:
A Linear Time Algorithm for the Maximum Matching Problem on Cographs.
BIT 33(3): 420-433 (1993) |
| 8 | | Ming-Shing Yu,
Lin Yu Tseng,
Shoe-Jane Chang:
Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs.
Inf. Process. Lett. 46(1): 7-11 (1993) |
| 7 | | Ming-Shing Yu,
Cheng-Hsing Yang:
An O(n) Time Algorithm for Maximum Matching on Cographs.
Inf. Process. Lett. 47(2): 89-93 (1993) |
| 6 | | Ming-Shing Yu,
Cheng-Hsing Yang:
A Simple Optimal Parallel Algorithm for the Minimum Coloring Problem on Interval Graphs.
Inf. Process. Lett. 48(1): 47-51 (1993) |
| 1992 |
|---|
| 5 | | Ming-Shing Yu,
Cheng-Hsing Yang:
An Optimal Parallel Algorithm for the Domatic Partition Problem on Interval Graphs.
ICPP (3) 1992: 146-152 |
| 4 | | Ming-Shing Yu,
Lin Yu Tseng,
Jiunn-Horng Lin:
Optimal Parallel Algorithms for Some Problems on Trees.
ICPP (3) 1992: 160-163 |
| 3 | | Ming-Shing Yu,
Cheng-Hsing Yang:
An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model.
Inf. Process. Lett. 44(1): 15-22 (1992) |
| 1990 |
|---|
| 2 | | Ming-Shing Yu,
C. L. Chen,
Richard C. T. Lee:
An Optimal Parallel Algorithm for Minimum Coloring of Intervals.
ICPP (3) 1990: 162-168 |
| 1989 |
|---|
| 1 | | Ming-Shing Yu,
C. L. Chen,
Richard Chia-Tung Lee:
Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs.
ICPP (3) 1989: 126-129 |
