The SCEAS System
| |||||||

## Search the dblp DataBase
Satoshi Matsumoto:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
**Learning of Elementary Formal Systems with Two Clauses Using Queries.**[Citation Graph (0, 0)][DBLP] ALT, 2005, pp:211-225 [Conf] - Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
**Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries.**[Citation Graph (0, 0)][DBLP] ALT, 2003, pp:144-158 [Conf] - Satoshi Matsumoto, Yukiko Hayashi, Takayoshi Shoudai
**Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data.**[Citation Graph (0, 0)][DBLP] ALT, 1997, pp:212-227 [Conf] - Satoshi Matsumoto, Takayoshi Shoudai
**Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries.**[Citation Graph (0, 0)][DBLP] ALT, 2004, pp:425-439 [Conf] - Satoshi Matsumoto, Ayumi Shinohara
**Refutably Probably Approximately Correct Learning.**[Citation Graph (0, 0)][DBLP] AII/ALT, 1994, pp:469-483 [Conf] - Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara
**Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables.**[Citation Graph (0, 0)][DBLP] ALT, 2003, pp:114-128 [Conf] - Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
**Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.**[Citation Graph (0, 0)][DBLP] Australian Joint Conference on Artificial Intelligence, 2002, pp:523-534 [Conf] - Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
**Uniform Characterizations of Polynomial-Query Learnabilities.**[Citation Graph (0, 0)][DBLP] Discovery Science, 1998, pp:84-92 [Conf] - Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida, Satoshi Matsumoto
**Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery.**[Citation Graph (0, 0)][DBLP] EJC, 1999, pp:85-102 [Conf] - Satoshi Matsumoto, Ayumi Shinohara
**Learning Pattern Languages Using Queries.**[Citation Graph (0, 0)][DBLP] EuroCOLT, 1997, pp:185-197 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICPP, 1987, pp:327-329 [Conf] - Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida
**Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data.**[Citation Graph (0, 0)][DBLP] ILP, 2003, pp:347-364 [Conf] - Tomotaka Yano, Ken Ohara, Toru Kuwahara, Satoshi Matsumoto, Qiusheng Xie, Hirobumi Fukuoka
**Flexible and Robust CIM Architecture using Distributed Objects.**[Citation Graph (0, 0)][DBLP] ISADS, 1999, pp:92-97 [Conf] - Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara
**Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data.**[Citation Graph (0, 0)][DBLP] PRICAI, 2004, pp:211-220 [Conf] - Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
**Uniform characterizations of polynomial-query learnabilities.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:292, n:2, pp:377-385 [Journal] - Rika Okada, Satoshi Matsumoto, Tomoyuki Uchida, Yusuke Suzuki, Takayoshi Shoudai
**Exact Learning of Finite Unions of Graph Patterns from Queries.**[Citation Graph (0, 0)][DBLP] ALT, 2007, pp:298-312 [Conf]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |