2008 |
17 | EE | Satoshi Matsumoto,
Takayoshi Shoudai,
Tomoyuki Uchida,
Tetsuhiro Miyahara,
Yusuke Suzuki:
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.
IEICE Transactions 91-D(2): 222-230 (2008) |
2007 |
16 | EE | Rika Okada,
Satoshi Matsumoto,
Tomoyuki Uchida,
Yusuke Suzuki,
Takayoshi Shoudai:
Exact Learning of Finite Unions of Graph Patterns from Queries.
ALT 2007: 298-312 |
2005 |
15 | EE | Hirotaka Kato,
Satoshi Matsumoto,
Tetsuhiro Miyahara:
Learning of Elementary Formal Systems with Two Clauses Using Queries.
ALT 2005: 211-225 |
2004 |
14 | EE | Satoshi Matsumoto,
Takayoshi Shoudai:
Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries.
ALT 2004: 425-439 |
13 | EE | Yusuke Suzuki,
Takayoshi Shoudai,
Satoshi Matsumoto,
Tetsuhiro Miyahara:
Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data.
PRICAI 2004: 211-220 |
2003 |
12 | EE | Yusuke Suzuki,
Takayoshi Shoudai,
Satoshi Matsumoto,
Tomoyuki Uchida,
Tetsuhiro Miyahara:
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables.
ALT 2003: 114-128 |
11 | EE | Satoshi Matsumoto,
Yusuke Suzuki,
Takayoshi Shoudai,
Tetsuhiro Miyahara,
Tomoyuki Uchida:
Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries.
ALT 2003: 144-158 |
10 | EE | Yusuke Suzuki,
Takayoshi Shoudai,
Satoshi Matsumoto,
Tomoyuki Uchida:
Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data.
ILP 2003: 347-364 |
9 | | Yosuke Hayashi,
Satoshi Matsumoto,
Ayumi Shinohara,
Masayuki Takeda:
Uniform characterizations of polynomial-query learnabilities.
Theor. Comput. Sci. 292(2): 377-385 (2003) |
2002 |
8 | EE | Satoshi Matsumoto,
Takayoshi Shoudai,
Tetsuhiro Miyahara,
Tomoyuki Uchida:
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.
Australian Joint Conference on Artificial Intelligence 2002: 523-534 |
1999 |
7 | | Takayoshi Shoudai,
Tetsuhiro Miyahara,
Tomoyuki Uchida,
Satoshi Matsumoto:
Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery.
EJC 1999: 85-102 |
6 | EE | Tomotaka Yano,
Ken Ohara,
Toru Kuwahara,
Satoshi Matsumoto,
Qiusheng Xie,
Hirobumi Fukuoka:
Flexible and Robust CIM Architecture using Distributed Objects.
ISADS 1999: 92-97 |
1998 |
5 | EE | Yosuke Hayashi,
Satoshi Matsumoto,
Ayumi Shinohara,
Masayuki Takeda:
Uniform Characterizations of Polynomial-Query Learnabilities.
Discovery Science 1998: 84-92 |
1997 |
4 | | Satoshi Matsumoto,
Yukiko Hayashi,
Takayoshi Shoudai:
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data.
ALT 1997: 212-227 |
3 | | Satoshi Matsumoto,
Ayumi Shinohara:
Learning Pattern Languages Using Queries.
EuroCOLT 1997: 185-197 |
1994 |
2 | | Satoshi Matsumoto,
Ayumi Shinohara:
Refutably Probably Approximately Correct Learning.
AII/ALT 1994: 469-483 |
1987 |
1 | | Katsuhiko Asada,
Hiroaki Terada,
Satoshi Matsumoto,
Souichi Miyata,
Hajime Asano,
Hiroki Miura,
Masahisa Shimizu,
Shinji Komori,
Takeshi Fukuhara,
Kenji Shima:
Hardware Structure of a One-Chip Data Driven Processor: Q-p.
ICPP 1987: 327-329 |