Yung-Hsing Peng

According to our database1, Yung-Hsing Peng authored at least 18 papers between 2007 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Improved Algorithm with Azimuth Clustering for Detecting Turning Regions on GPS Trajectories.
Proceedings of the Technologies and Applications of Artificial Intelligence, 2023

2020
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems.
Algorithmica, 2020

2015
An investigation of spacial approaches for crop price forecasting in different Taiwan markets.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2015

Developing crop price forecasting service using open data from Taiwan markets.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2015

2014
Finding the gapped longest common subsequence by incremental suffix maximum queries.
Inf. Comput., 2014

The trading on the mutual funds by gene expression programming with Sortino ratio.
Appl. Soft Comput., 2014

An effective wavelength utilization for spectroscopic analysis on orchid chlorophyll measurement.
Proceedings of the 2014 IEEE International Conference on Automation Science and Engineering, 2014

2013
An Efficient RSM-Based Algorithm for Measuring Chlorophyll on Orchid Leaves with a Microspectrometer.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2013

2012
A new efficient indexing algorithm for one-dimensional real scaled patterns.
J. Comput. Syst. Sci., 2012

2011
The indexing for one-dimensional proportionally-scaled strings.
Inf. Process. Lett., 2011

Genetic algorithms for the investment of the mutual fund with global trend indicator.
Expert Syst. Appl., 2011

2010
Efficient indexing algorithms for one-dimensional discretely-scaled strings.
Inf. Process. Lett., 2010

An Algorithm and Applications to Sequence Alignment with Weighted Constraints.
Int. J. Found. Comput. Sci., 2010

Efficient algorithms for the block edit problems.
Inf. Comput., 2010

2008
Efficient algorithms for finding interleaving relationship between sequences.
Inf. Process. Lett., 2008

Near-Optimal Block Alignments.
IEICE Trans. Inf. Syst., 2008

Efficient Sparse Dynamic Programming for the Merged LCS Problem.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

2007
Dynamic programming algorithms for the mosaic longest common subsequence problem.
Inf. Process. Lett., 2007


  Loading...