dblp.uni-trier.dewww.uni-trier.de

Yasuhiro Tajima

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
10EEYasuhiro Tajima, Yoshiyuki Kotani: Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries. ICGI 2008: 187-199
2006
9EEKanako Komiya, Yasuhiro Tajima, Nobuo Inui, Yoshiyuki Kotani: Generating a Set of Rules to Determine Honorific Expression Using Decision Tree Learning. CICLing 2006: 315-318
2005
8 Yasuhiro Tajima, Yoshiyuki Kotani: A Restricted Sample Distribution of Simple Deterministic Languages and its Learnability. PDPTA 2005: 427-432
2004
7EEYasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada: An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. ICGI 2004: 288-289
6EEYasutaka Otake, Yasuhiro Tajima, Matsuaki Terada: A SIP-Based Voice-Mail System with Voice Recognition. ICOIN 2004: 985-994
5 Yasuhiro Tajima, Yoshiyuki Kotani, Matsuaki Terada: Polynomial Time PAC Learnability of a Sub-class of Linear Languages. PDPTA 2004: 338-344
4EEKohta Ohshima, Yasuhiro Tajima, Matsuaki Terada: A Teleconferencing System with High-Speed Stream Mixing for Voice over IP. SAINT 2004: 295-300
3EEYasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada: Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comput. Sci. 329(1-3): 203-221 (2004)
2002
2EEYasuhiro Tajima, Matsuaki Terada: A PAC Learnability of Simple Deterministic Languages. ICGI 2002: 249-260
2000
1 Yasuhiro Tajima, Etsuji Tomita: A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. ICGI 2000: 284-297

Coauthor Index

1Nobuo Inui [9]
2Kanako Komiya [9]
3Yoshiyuki Kotani [5] [7] [8] [9] [10]
4Kohta Ohshima [4]
5Yasutaka Otake [6]
6Matsuaki Terada [2] [3] [4] [5] [6] [7]
7Etsuji Tomita [1] [3]
8Mitsuo Wakatsuki [3]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)