default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChin-Wen Ho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c25]Sih-Huei Chen, Jia-Ching Wang, Wen-Chi Hsieh, Yu-Hao Chin, Chin-Wen Ho, Chung-Hsien Wu
:
Speech emotion classification using multiple kernel Gaussian process. APSIPA 2016: 1-4- [c24]Chia-Yung Hsu, Ryandhimas E. Zezario, Jia-Ching Wang, Chin-Wen Ho, Xugang Lu, Yu Tsao:
Incorporating local environment information with ensemble neural networks to robust automatic speech recognition. ISCSLP 2016: 1-5 - 2015
- [c23]Meng-Yi Chen, Chang-En Pu, Fang-Chin Wu, Huei-Yu Lai, Chin-Wen Ho:
Rapidly mutating Y-STRs population data in Taiwan and haplotype probability estimation for forensic purposes. ICCST 2015: 395-402 - 2014
- [j27]Chia-Hao Chin, Shu-Hwa Chen, Hsin-Hung Wu, Chin-Wen Ho, Ming-Tat Ko, Chung-Yen Lin:
cytoHubba: identifying hub objects and sub-networks from complex interactome. BMC Syst. Biol. 8(S-4): S11 (2014) - [c22]Wen-Chi Hsieh, Chin-Wen Ho, Viet-Hang Duong, Yuan-Shan Lee, Jia-Ching Wang:
2D semi-NMF of scale-frequency map for environmental sound classification. APSIPA 2014: 1-4 - 2010
- [j26]Chia-Hao Chin, Shu-Hwa Chen, Chin-Wen Ho, Ming-Tat Ko, Chung-Yen Lin:
A hub-attachment based method to detect functional modules from confidence-scored protein interactions and expression profiles. BMC Bioinform. 11(S-1): 25 (2010)
2000 – 2009
- 2008
- [j25]Hsin-Hung Chou, Ming-Tat Ko, Chin-Wen Ho, Gen-Huey Chen:
Node-searching problem on block graphs. Discret. Appl. Math. 156(1): 55-75 (2008) - [j24]Chung-Yen Lin, Chia-Hao Chin, Hsin-Hung Wu, Shu-Hwa Chen, Chin-Wen Ho, Ming-Tat Ko:
Hubba: hub objects analyzer - a framework of interactome hubs identification for network biology. Nucleic Acids Res. 36(Web-Server-Issue): 438-443 (2008) - 2007
- [j23]Chih-Hung Lai, Jie-Chi Yang, Fei Ching Chen, Chin-Wen Ho, Tak-Wai Chan:
Affordances of mobile technologies for experiential learning: the interplay of technology and pedagogical practices. J. Comput. Assist. Learn. 23(4): 326-337 (2007) - 2006
- [j22]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko:
The Hamiltonian problem on distance-hereditary graphs. Discret. Appl. Math. 154(3): 508-524 (2006) - 2005
- [c21]Mong-Chen Chiang, Yi-Chan Deng, Han-Zen Chang, Hui-Chun Liao, Chin-Wen Ho, Tak-Wai Chan:
EduBingo: A Bingo-like Game for Mathematics Skill Building. WMTE 2005: 93-95 - [c20]Chih-Hung Lai, Jie-Chi Yang, Tak-Wai Chan, Chin-Wen Ho, Fei Ching Chen, Jing-San Liang:
Improving Experiential Learning with Mobile Technologies. WMTE 2005: 141-145 - 2004
- [c19]Yen-Hua Chen, Chuo-Bin Lin, Chin-Wen Ho, Shelley Shwu-Ching Young, Ia-Ming Ching, Tak-Wai Chan:
Exploring Major Events and the Accumulated User Forecasting Model to Support Building Web-Based Learning Communities - Preliminary Analysis from the School for All. ICALT 2004 - 2003
- [j21]Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko:
Powers of Asteroidal Triple-free Graphs with Applications. Ars Comb. 67 (2003) - 2002
- [j20]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discret. Math. 15(4): 488-518 (2002) - [c18]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko:
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 - [c17]Chih-Hung Lai, Jie-Chi Yang, Bau-Lo Jheng, Tak-Wai Chan, Chin-Wen Ho, Jing-San Liang:
A Web-Based Information-Learning-Passport System Using the ARCS Model. ICCE 2002: 896-897 - 2001
- [j19]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Longest Fault-Free Paths in Star Graphs with Edge Faults. IEEE Trans. Computers 50(9): 960-971 (2001) - [j18]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Longest fault-free paths in star graphs with vertex faults. Theor. Comput. Sci. 262(1): 215-227 (2001) - 2000
- [j17]Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu:
Graph Searching on Some Subclasses of Chordal Graphs. Algorithmica 27(3): 395-426 (2000) - [j16]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. J. Algorithms 35(1): 50-81 (2000) - [j15]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Hamiltonian-laceability of star graphs. Networks 36(4): 225-232 (2000) - [j14]Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang:
Edge and node searching problems on trees. Theor. Comput. Sci. 240(2): 429-446 (2000)
1990 – 1999
- 1999
- [j13]Chin-Wen Ho, Jou-Ming Chang:
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. Inf. Process. Lett. 69(2): 87-93 (1999) - [j12]Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen:
Parallel Decomposition of Generalized Series-Parallel Graphs. J. Inf. Sci. Eng. 15(3): 407-417 (1999) - [j11]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Efficient Parallel Algorithms on Distance Hereditary Graphs. Parallel Process. Lett. 9(1): 43-52 (1999) - [j10]Yu-Chee Tseng, San-Yuan Wang, Chin-Wen Ho:
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach. IEEE Trans. Parallel Distributed Syst. 10(1): 44-61 (1999) - [j9]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs. IEEE Trans. Parallel Distributed Syst. 10(3): 223-237 (1999) - [c16]Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko:
LexBFS-Ordering in Asteroidal Triple-Free Graphs. ISAAC 1999: 163-172 - 1998
- [j8]Jou-Ming Chang, Chin-Wen Ho:
The Recognition of Geodetically Connected Graphs. Inf. Process. Lett. 65(2): 81-88 (1998) - [j7]Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen:
An Efficient Parallel Strategy for Computing K-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees. J. Parallel Distributed Comput. 51(2): 89-113 (1998) - [c15]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs. ASIAN 1998: 113-124 - [c14]Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang:
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. COCOON 1998: 279-288 - [c13]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Embed Longest Rings onto Star Graphs with Vertex Faults. ICPP 1998: 140-147 - [c12]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. IRREGULAR 1998: 298-309 - [c11]Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 - 1997
- [c10]Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang:
Edge and Node Searching Problems on Trees. COCOON 1997: 284-293 - [c9]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs. ICPADS 1997: 744-749 - [c8]Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko:
. Efficient Parallel Algorithms on Distance-Hereditary Graphs. ICPP 1997: 20-25 - [c7]Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen:
An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. IPPS 1997: 603-607 - [c6]Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho:
Hamiltonian-Laceability of Star Graphs. ISPAN 1997: 112-117 - [c5]Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen:
Parallel Decomposition of Generalized Series-Parallel Graphs. PDPTA 1997: 890-896 - 1996
- [c4]Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang:
Graph Searching on Chordal Graphs. ISAAC 1996: 156-165 - [c3]San-Yuan Wang, Yu-Chee Tseng, Chin-Wen Ho:
Efficient single-node broadcast in wormhole-routed multicomputers: a network-partitioning approach. SPDP 1996: 178-185 - 1995
- [j6]Ai-Jia Hsieh, Kuo-Chin Fan, Tzu-I Fan, Chin-Wen Ho:
A Stroke-Based Handwritten Chinese Character Recognition System Using Greedy Matching Method. J. Inf. Sci. Eng. 11(1): 1-22 (1995) - [j5]Ai-Jia Hsieh, Chin-Wen Ho, Kuo-Chin Fan:
An extension of the bipartite weighted matching problem. Pattern Recognit. Lett. 16(4): 347-353 (1995) - 1994
- [c2]Sun-Yuan Hsieh, Chin-Wen Ho:
An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. ISAAC 1994: 496-504 - 1991
- [j4]Lang-Sheng Liu, Chin-Wen Ho, Jang-Ping Sheu:
Synthesizing the Parallelism of Nested Loops Using An Index Shift Method. J. Inf. Sci. Eng. 7(4): 529-541 (1991) - 1990
- [j3]Chin-Wen Ho, Richard C. T. Lee:
A Parallel Algorithm for Solving Sparse Triangular Systems. IEEE Trans. Computers 39(6): 848-852 (1990) - [c1]Lang-Sheng Liu, Chin-Wen Ho, Jang-Ping Sheu:
On the Parallelism of Nested For-Loops Using Index Shift Method. ICPP (2) 1990: 119-123
1980 – 1989
- 1989
- [j2]Chin-Wen Ho, Richard C. T. Lee:
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. Inf. Process. Lett. 31(2): 61-68 (1989) - 1988
- [j1]Chin-Wen Ho, Richard C. T. Lee:
Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. Inf. Process. Lett. 28(6): 301-309 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-26 18:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
