中央研究院資訊科學研究所智慧型代理人系統實驗室自然輸入法
[中文版] [English Version]
 
簡介
學歷
經歷
研究方向
教學
榮譽
著作
  Biological Computing
  Biological Literature Mining
  Natural Language
Processing, and e-Learning
  algorithms
 
IASL實驗室參加日本舉辦的第二屆NTCIR-6跨語言中文問答系統比賽,榮獲第一名(2007)
「智慧型代理人系統實驗室(IASL)」參加2006年SIGHAN 斷詞比賽WS CityU Closed分項獲得13隊中第1名(2006)
「智慧型代理人系統實驗室(IASL)」參加2006年SIGHAN 專有名詞辨識比賽NER CityU Closed分項獲得8隊中第2名(2006)
 


許聞廉  教授
特聘研究員, IEEE Fellow  
中央研究院資訊科學所
台北市南港區研究院路二段128號
電話:02-27883799 轉1804
傳真:02-27824814
E-mail: hsuiis.sinica.edu.tw
2012 圖形演算法及生物資訊應用 課程相關論文Homework Assignments 課程投影片


這些論文都可在我的網站上download,你也可直接到期刊上download。

1. W. L. Hsu, “PC-trees vs. PQ-trees,” invited talk, Workshop on Graph Structures and Algorithms, also, appeared in Lecture Notes in Computer Science 2108, (2001), 207-217.
2. W. L. Hsu, "A simple test for the consecutive ones property", Journal of Algorithms 43, (2002), 1-16.
3. W. L. Hsu, "A new test for interval graphs", Lecture Notes in Computer Science 657, 11-16, (1992).
4. W. K. Shih and W. L. Hsu, "A new planarity test," Theoretical Computer Science 223, (1999), 179-191.
5. W. L. Hsu, “An Efficient Implementation of the PC-Tree Algorithm of Shih & Hsu's Planarity Test,” Technical Report, Institute of Information Science, Academia Sinica, (2003).
6. W. L. Hsu and R. McConnell, "PQ Trees PC Trees and Planar Graphs," Handbook of Data Structures and Applications, Dinesh P Mehta and Sartaj Sahni ed., (2003).
7. Wen-Lian Hsu, “A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees,” Proceedings of COCOON’05, (2005).
8. W. F. Lu and W. L. Hsu, “A Test for the Consecutive Ones Property on Noisy Data - Application to Physical Mapping and Sequence Assembly,” Journal of Computational Biology 10(5), (2003), 709-735; also appeared in Lecture Notes in Computer Science 1276.
9. W. F. Lu and W. L. Hsu, “A Test for Interval Graphs on Noisy Data,” Lecture Notes in Computer Science 2647, 195-208, (2003).