Yen-Chun Lin

Orcid: 0000-0002-1826-099X

According to our database1, Yen-Chun Lin authored at least 53 papers between 1988 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Mapping Asbestos-Cement Corrugated Roofing Tiles with Imagery Cube via Machine Learning in Taiwan.
Remote. Sens., 2022

A smart pillbox for increasing user's medication adherence.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2022

CAMPUS: A University Crowdsourcing Platform for Reporting Facility, Status Update, and Problem Area Information.
Proceedings of the Companion Computer Supported Cooperative Work and Social Computing, 2022

How to Guide Task-oriented Chatbot Users, and When: A Mixed-methods Study of Combinations of Chatbot Guidance Types and Timings.
Proceedings of the CHI '22: CHI Conference on Human Factors in Computing Systems, New Orleans, LA, USA, 29 April 2022, 2022

2019
Development of a Smart Assistance System for Patients With Blepharoptosis.
IEEE Access, 2019

2018
Knowledge Hub: A Knowledge Service Platform to Facilitate Knowledge Creation Cycle in a University.
Proceedings of the Knowledge Management in Organizations - 13th International Conference, 2018

2014
An Immersive and Interactive Map Touring System Based on Traveler Conceptual Models.
IEICE Trans. Inf. Syst., 2014

2013
Elastic Warping of Radial Features for Shape Alignment in Sketch Retrieval.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2013

2012
Image matting through a Web browser.
Multim. Tools Appl., 2012

Open Source for Web-Based Video Editing.
J. Inf. Sci. Eng., 2012

2011
New Parallel Prefix Algorithm for Multicomputers.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2011

2010
Web-based image matting.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009
Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2.
ACM Trans. Design Autom. Electr. Syst., 2009

Fast problem-size-independent parallel prefix circuits.
J. Parallel Distributed Comput., 2009

2007
Parallel motion estimation on the MDSP multiprocessor.
Neural Parallel Sci. Comput., 2007

2006
Multiuser interior design over the internet.
Proceedings of the Winter Simulation Conference WSC 2006, 2006

2005
Faster optimal parallel prefix circuits: New algorithmic construction.
J. Parallel Distributed Comput., 2005

A Case Study of Technologies for a Digital Video Archive System.
Proceedings of the 3rd International Conference on Digital Archive Technologies, 2005

2004
A new approach to constructing optimal parallel prefix circuits with small depth.
J. Parallel Distributed Comput., 2004

2003
Foreword.
J. Supercomput., 2003

Constructing <i>H</i>4, a Fast Depth-Size Optimal Parallel Prefix Circuit.
J. Supercomput., 2003

Z4: A New Depth-Size Optimal Parallel Prefix Circuit With Small Depth.
Neural Parallel Sci. Comput., 2003

Optimal Parallel Prefix on the Postal Model.
J. Inf. Sci. Eng., 2003

2002
Deriving a fast systolic algorithm for the longest common subsequence problem.
Parallel Algorithms Appl., 2002

A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem.
J. Inf. Sci. Eng., 2002

A Parallel Prefix Circuit with Minimum Layout Cost.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002

A New Approach to Constructing Optimal Prefix Circuits with Small Depth.
Proceedings of the International Symposium on Parallel Architectures, 2002

2000
Efficient Parallel Prefix Algorithms on Multicomputers.
J. Inf. Sci. Eng., 2000

1999
A New Class of Depth-Size Optimal Parallel Prefix Circuits.
J. Supercomput., 1999

Optimal Parallel Prefix Circuits with Fan-Ot 2 and Corresponding Parallel Algorithms.
Neural Parallel Sci. Comput., 1999

Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems.
Inf. Process. Lett., 1999

Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time.
Inf. Process. Lett., 1999

1998
An Efficient Systolic Algorithm for the Longest Common Subsequence Problem.
J. Supercomput., 1998

1997
Perfectly overlapped generation of long runs on a transputer array for sorting.
Microprocess. Microsystems, 1997

1996
A transformation methodology for systolic design.
Neural Parallel Sci. Comput., 1996

Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array.
Inf. Process. Lett., 1996

A Family of Efficient Algorithms for the Prefix Operation on Message-Passing Computers.
Proceedings of the High-Performance Computing and Networking, 1996

Efficient parallel prefix algorithms on fully connected message-passing computers.
Proceedings of the 3rd International Conference on High Performance Computing, 1996

1994
New Systolic Arrays for the Longest Common Subsequence Problem.
Parallel Comput., 1994

1993
On Balancing Sorting on a Linear Array.
IEEE Trans. Parallel Distributed Syst., 1993

Perfectly Overlapped Generation of Long Runs for Sorting Large Files.
J. Parallel Distributed Comput., 1993

Generation of Long Sorted Runs on a Unidirectional Array.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992
A Low-Delay CELP Coder for the CCITT 16 kb/s Speech Coding Standard.
IEEE J. Sel. Areas Commun., 1992

Automatic Generation of Parallel Occam Programs for Transputer Rings.
J. Parallel Distributed Comput., 1992

Perfectly Overlapped Sorting on a Linear Array.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991
Array size anomaly of problem-size independent systolic arrays for matrix-vector multiplication.
Parallel Comput., 1991

An FP-based tool for the synthesis of regular array algorithms.
Parallel Comput., 1991

Translating from FP to Occam for systolic algorithms.
Microprocess. Microsystems, 1991

A fixed-point 16 kb/s LD-CELP algorithm.
Proceedings of the 1991 International Conference on Acoustics, 1991

Fast generation of long sorted runs for sorting a large file.
Proceedings of the Application Specific Array Processors, 1991

1990
Parallel sorting with cooperating heaps in a linear array of processors.
Parallel Comput., 1990

Three-Level FP Programs and the Derivation of Problem-Size-Dependent/Independent Systolic Algorithms.
J. Inf. Sci. Eng., 1990

1988
The use of aFP to design regular array algorithms.
Proceedings of the 1988 Internation Conference on Computer Languages, 1988


  Loading...