Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Huang-Ting Chan"'
Autor:
Huang-Ting Chan, 詹皇廷
104
The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences can be measured by the LCS algorithms, which have been extensively st
The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences can be measured by the LCS algorithms, which have been extensively st
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61009108933762382523
Publikováno v:
Algorithmica. 82:2039-2062
The similarity of two one-dimensional sequences is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the two or higher dimensional data. Thus, for the two-dimensional d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d73828c78ae698f5e88892935694d2e2
https://doi.org/10.1007/s00453-020-00685-8
https://doi.org/10.1007/s00453-020-00685-8
Autor:
Huang-Ting Chang, 張凰婷
96
This study aims at inquiring life movements of reserved teachers in the process of being teachers via their life narrative; through the life experience of reserved teachers searching for being teachers, in addition to reflection of personal c
This study aims at inquiring life movements of reserved teachers in the process of being teachers via their life narrative; through the life experience of reserved teachers searching for being teachers, in addition to reflection of personal c
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/85q3bj