- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j30 |      | Hsiang-An Wang, Yen-Chun Lin, Hua-Ting Lu, Shang-Te Lin: Open Source for Web-Based Video Editing. J. Inf. Sci. Eng. 28(4): 787-801 (2012) |
| j29 | | Yen-Chun Lin, Hsiang-An Wang, Yi-Fang Hsieh: Image matting through a Web browser. Multimedia Tools Appl. 61(3): 551-570 (2012) |
| 2011 | ||
| c10 | | |
| 2010 | ||
| c9 | | |
| 2009 | ||
| j28 | | Yen-Chun Lin, Li-Ling Hung: Fast problem-size-independent parallel prefix circuits. J. Parallel Distrib. Comput. 69(4): 382-388 (2009) |
| j27 | | Yen-Chun Lin, Li-Ling Hung: Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2. ACM Trans. Design Autom. Electr. Syst. 14(1) (2009) |
| 2007 | ||
| j26 | | Yen-Chun Lin, Chuan-Da Hsiung: Parallel motion estimation on the MDSP multiprocessor. Neural Parallel & Scientific Comp. 15(1): 45-58 (2007) |
| 2006 | ||
| c8 | | Yen-Chun Lin, Chen-Chuan Pan, Jhih-En Kuo: Multiuser interior design over the internet. Winter Simulation Conference 2006: 569-575 |
| 2005 | ||
| j25 | | Yen-Chun Lin, Chin-Yu Su: Faster optimal parallel prefix circuits: New algorithmic construction. J. Parallel Distrib. Comput. 65(12): 1585-1595 (2005) |
| 2004 | ||
| j24 | | Yen-Chun Lin, Jun-Wei Hsiao: A new approach to constructing optimal parallel prefix circuits with small depth. J. Parallel Distrib. Comput. 64(1): 97-107 (2004) |
| 2003 | ||
| j23 | | Yen-Chun Lin, Ching-Sung Yeh: Optimal Parallel Prefix on the Postal Model. J. Inf. Sci. Eng. 19(1): 75-83 (2003) |
| j22 | | Yen-Chun Lin, Jian-Nan Chen: Z4: A New Depth-Size Optimal Parallel Prefix Circuit With Small Depth. Neural Parallel & Scientific Comp. 11(3): 221-236 (2003) |
| j21 | | |
| j20 | | Yen-Chun Lin, Yao-Hsien Hsu, Chun-Keng Liu: Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit. The Journal of Supercomputing 24(3): 279-304 (2003) |
| 2002 | ||
| j19 | | Yen-Chun Lin, Jih-Wei Yeh: A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem. J. Inf. Sci. Eng. 18(4): 519-532 (2002) |
| j18 | | Yen-Chun Lin, Jih-Wei Yeh: Deriving a fast systolic algorithm for the longest common subsequence problem. Parallel Algorithms Appl. 17(1): 1-18 (2002) |
| c7 | | Yen-Chun Lin, Jun-Wei Hsiao: A New Approach to Constructing Optimal Prefix Circuits with Small Depth. ISPAN 2002: 99-104 |
| c6 |  | Yen-Chun Lin, Cheng-Hsien Chuang: A Parallel Prefix Circuit with Minimum Layout Cost. PDPTA 2002: 1521-1527 |
| 2000 | ||
| j17 | | Yen-Chun Lin, C. M. Lin: Efficient Parallel Prefix Algorithms on Multicomputers. J. Inf. Sci. Eng. 16(1): 41-64 (2000) |
| 1999 | ||
| j16 | | Yen-Chun Lin, Chun-Keng Liu: Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time. Inf. Process. Lett. 70(4): 191-195 (1999) |
| j15 | | Yen-Chun Lin, Ching-Sung Yeh: Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems. Inf. Process. Lett. 71(2): 91-95 (1999) |
| j14 | | Yen-Chun Lin: Optimal Parallel Prefix Circuits with Fan-Ot 2 and Corresponding Parallel Algorithms. Neural Parallel & Scientific Comp. 7(1): 33-42 (1999) |
| j13 | | Yen-Chun Lin, Chao-Cheng Shih: A New Class of Depth-Size Optimal Parallel Prefix Circuits. The Journal of Supercomputing 14(1): 39-52 (1999) |
| 1998 | ||
| j12 | | Yen-Chun Lin, Jyh-Chian Chen: An Efficient Systolic Algorithm for the Longest Common Subsequence Problem. The Journal of Supercomputing 12(4): 373-385 (1998) |
| c5 | | Yen-Chun Lin, Chao-Cheng Shih: A new class of depth-size optimal parallel prefix circuits. Computers and Their Applications 1998: 117-120 |
| 1996 | ||
| j11 | | Yen-Chun Lin: Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. Inf. Process. Lett. 60(4): 183-187 (1996) |
| j10 | | Yen-Chun Lin: A transformation methodology for systolic design. Neural Parallel & Scientific Comp. 4(1): 113-127 (1996) |
| c4 | | Yen-Chun Lin, C. M. Lin: A Family of Efficient Algorithms for the Prefix Operation on Message-Passing Computers. HPCN Europe 1996: 1003-1004 |
| 1994 | ||
| j9 | | Yen-Chun Lin: New Systolic Arrays for the Longest Common Subsequence Problem. Parallel Computing 20(9): 1323-1334 (1994) |
| 1993 | ||
| j8 | | Yen-Chun Lin: Perfectly Overlapped Generation of Long Runs for Sorting Large Files. J. Parallel Distrib. Comput. 19(2): 136-142 (1993) |
| j7 | | Yen-Chun Lin: On Balancing Sorting on a Linear Array. IEEE Trans. Parallel Distrib. Syst. 4(5): 566-571 (1993) |
| c3 | | Yen-Chun Lin, Horng-Yi Lai: Generation of Long Sorted Runs on a Unidirectional Array. ICPP 1993: 184-191 |
| 1992 | ||
| j6 | | Yen-Chun Lin, Yu-Ho Cheng: Automatic Generation of Parallel Occam Programs for Transputer Rings. J. Parallel Distrib. Comput. 16(2): 121-133 (1992) |
| j5 | | Juin-Hwey Chen, Richard V. Cox, Yen-Chun Lin, Nikil Jayant, Melvin J. Melchner: A Low-Delay CELP Coder for the CCITT 16 kb/s Speech Coding Standard. IEEE Journal on Selected Areas in Communications 10(5): 830-849 (1992) |
| c2 | | |
| 1991 | ||
| j4 | | Yen-Chun Lin: An FP-based tool for the synthesis of regular array algorithms. Parallel Computing 17(4-5): 457-470 (1991) |
| j3 | | Yen-Chun Lin: Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication. Parallel Computing 17(4-5): 515-522 (1991) |
| 1990 | ||
| j2 | | Yen-Chun Lin, Ferng-Ching Lin: Three-Level FP Programs and the Derivation of Problem-Size-Dependent/Independent Systolic Algorithms. J. Inf. Sci. Eng. 6(2): 117-137 (1990) |
| j1 | | Yen-Chun Lin, Ferng-Ching Lin: Parallel sorting with cooperating heaps in a linear array of processors. Parallel Computing 16(2-3): 273-278 (1990) |
| 1988 | ||
| c1 | | Yen-Chun Lin, Ferng-Ching Lin: The use of aFP to design regular array algorithms. ICCL 1988: 388-395 |
Colors in the list of coauthors
Last update Sat May 25 07:53:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page