| 2008 |
|---|
| 6 | EE | Kuo-Si Huang,
Chang-Biau Yang,
Kuo-Tsung Tseng,
Hsing-Yen Ann,
Yung-Hsing Peng:
Efficient algorithms for finding interleaving relationship between sequences.
Inf. Process. Lett. 105(5): 188-193 (2008) |
| 5 | EE | Hsing-Yen Ann,
Chang-Biau Yang,
Chiou-Ting Tseng,
Chiou-Yi Hor:
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.
Inf. Process. Lett. 108(6): 360-364 (2008) |
| 2007 |
|---|
| 4 | EE | Kuo-Si Huang,
Chang-Biau Yang,
Kuo-Tsung Tseng,
Yung-Hsing Peng,
Hsing-Yen Ann:
Dynamic programming algorithms for the mosaic longest common subsequence problem.
Inf. Process. Lett. 102(2-3): 99-103 (2007) |
| 2002 |
|---|
| 3 | EE | Ye-In Chang,
Hsing-Yen Ann,
Wei-Horng Yeh:
An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases.
J. Vis. Lang. Comput. 13(2): 117-147 (2002) |
| 2000 |
|---|
| 2 | EE | Ye-In Chang,
Hsing-Yen Ann,
Wei-Horng Yeh:
A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures.
Pattern Recognition 33(8): 1263-1276 (2000) |
| 1999 |
|---|
| 1 | EE | Ye-In Chang,
Hsing-Yen Ann:
A note on adaptive 2D-H strings.
Pattern Recognition Letters 20(1): 15-20 (1999) |
