![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Wei-Chun Kao
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c4]Huey-Ing Liu, Meng-Wei Chen, Wei-Chun Kao, Yao-Wen Yeh, Cheng-Xuan Yang:
GSAP: A Hybrid GRU and Self-Attention Based Model for Dual Medical NLP Tasks. KST 2022: 80-85
2010 – 2019
- 2019
- [i1]Rosdyana Mangir Irawan Kusuma, Trang-Thi Ho, Wei-Chun Kao, Yu-Yen Ou, Kai-Lung Hua:
Using Deep Learning Neural Networks and Candlestick Chart Representation to Predict Stock Market. CoRR abs/1903.12258 (2019) - 2013
- [j5]Shuenn-Yuh Lee, Ming-Chun Liang, Tsung-Heng Tsai
, Wei-Chun Kao:
Analysis and implementation of a fourth-order bandpass filter for R-wave detection of an implantable cardiac microstimulator. Int. J. Circuit Theory Appl. 41(11): 1188-1202 (2013) - [j4]Wen-Hao Liu, Wei-Chun Kao, Yih-Lang Li, Kai-Yuan Chao:
NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing With Bounded-Length Maze Routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(5): 709-722 (2013) - 2011
- [b1]Wei-Chun Kao:
Algorithms for Next-Generation High-Throughput Sequencing Technologies. University of California, Berkeley, USA, 2011 - [j3]Wei-Chun Kao, Yun S. Song:
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing. J. Comput. Biol. 18(3): 365-377 (2011) - 2010
- [c3]Wen-Hao Liu, Wei-Chun Kao, Yih-Lang Li, Kai-Yuan Chao:
Multi-threaded collision-aware global routing with bounded-length maze routing. DAC 2010: 200-205 - [c2]Wei-Chun Kao, Yun S. Song:
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing. RECOMB 2010: 233-247
2000 – 2009
- 2004
- [j2]Wei-Chun Kao, Kai-Min Chung
, Chia-Liang Sun, Chih-Jen Lin
:
Decomposition Methods for Linear Support Vector Machines. Neural Comput. 16(8): 1689-1704 (2004) - 2003
- [j1]Kai-Min Chung
, Wei-Chun Kao, Chia-Liang Sun, Li-Lun Wang, Chih-Jen Lin
:
Radius Margin Bounds for Support Vector Machines with the RBF Kernel. Neural Comput. 15(11): 2643-2681 (2003) - [c1]Kai-Min Chung, Wei-Chun Kao, Tony Sun, Chih-Jen Lin:
Decomposition methods for linear support vector machines. ICASSP (4) 2003: 868-871
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-11 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint