| 2009 |
|---|
| 39 | EE | Takashi Katoh,
Hiroki Arimura,
Kouichi Hirata:
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences.
PAKDD 2009: 172-183 |
| 38 | EE | Taishin Daigo,
Kouichi Hirata:
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay.
SOFSEM 2009: 181-192 |
| 37 | EE | Taku Aratsu,
Kouichi Hirata,
Tetsuji Kuboyama:
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.
SOFSEM 2009: 93-104 |
| 2008 |
|---|
| 36 | EE | Tetsuji Kuboyama,
Kouichi Hirata,
Kiyoko F. Aoki-Kinoshita:
An Efficient Unordered Tree Kernel and Its Application to Glycan Classification.
PAKDD 2008: 184-195 |
| 35 | EE | Takashi Katoh,
Kouichi Hirata:
A Simple Characterization on Serially Constructible Episodes.
PAKDD 2008: 600-607 |
| 34 | EE | Arnoldo José Müller Molina,
Kouichi Hirata,
Takeshi Shinohara:
A Tree Distance Function Based on Multi-sets.
PAKDD Workshops 2008: 87-98 |
| 33 | EE | Taku Aratsu,
Kouichi Hirata,
Tetsuji Kuboyama:
Sibling Distance for Rooted Labeled Trees.
PAKDD Workshops 2008: 99-110 |
| 2007 |
|---|
| 32 | EE | Akihiro Yamamoto,
Kouichi Hirata:
The Fifth Workshop on Learning with Logics and Logics for Learning (LLLL2007).
JSAI 2007: 305-306 |
| 31 | EE | Takashi Katoh,
Kouichi Hirata,
Masateru Harao:
Mining Frequent Diamond Episodes from Event Sequences.
MDAI 2007: 477-488 |
| 30 | EE | Kengo Kubo,
Keizo Yamada,
Kouichi Hirata,
Masateru Harao:
Efficient schema matching algorithm based on pre-checking.
Systems and Computers in Japan 38(4): 84-92 (2007) |
| 2006 |
|---|
| 29 | EE | Takashi Katoh,
Kouichi Hirata,
Masateru Harao:
Mining Sectorial Episodes from Event Sequences.
Discovery Science 2006: 137-148 |
| 28 | EE | Akihiro Yamamoto,
Kouichi Hirata,
Ken Satoh:
The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006).
JSAI 2006: 249-250 |
| 2005 |
|---|
| 27 | EE | Nobuhito Ohkura,
Kouichi Hirata,
Tetsuji Kuboyama,
Masateru Harao:
The q-Gram Distance for Ordered Unlabeled Trees.
Discovery Science 2005: 189-202 |
| 26 | EE | Kouichi Hirata,
Megumi Kuwabara,
Masateru Harao:
On Finding Acyclic Subhypergraphs.
FCT 2005: 491-503 |
| 25 | EE | Kosuke Ono,
Masateru Harao,
Kouichi Hirata:
Multi-Agent Based Modeling and Simulation of Consensus Formations in Arguments.
ICITA (1) 2005: 264-267 |
| 24 | EE | Shogo Ozaki,
Masateru Harao,
Kouichi Hirata:
Performance Analysis for Construction of a Performance Practice Support System.
ICITA (2) 2005: 415-418 |
| 23 | EE | Akihiro Yamamoto,
Kouichi Hirata:
Workshop on Learning with Logics and Logics for Learning (LLLL).
JSAI Workshops 2005: 167-168 |
| 22 | EE | Megumi Kuwabara,
Takeshi Ogawa,
Kouichi Hirata,
Masateru Harao:
On Generalization and Subsumption for Ordered Clauses.
JSAI Workshops 2005: 212-223 |
| 21 | EE | Eiju Hirowatari,
Kouichi Hirata,
Tetsuhiro Miyahara:
Prediction of Recursive Real-Valued Functions from Finite Examples.
JSAI Workshops 2005: 224-234 |
| 20 | EE | Kosuke Ono,
Takashi Hata,
Toyofumi Maetani,
Masateru Harao,
Kouichi Hirata:
Development of a Multi-Agent Based Generic Traffic Simulator.
JSAI Workshops 2005: 249-260 |
| 19 | EE | Yoshikazu Shima,
Kouichi Hirata,
Masateru Harao:
Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning.
PAKDD 2005: 50-60 |
| 18 | EE | Kouichi Hirata:
Prediction-hardness of acyclic conjunctive queries.
Theor. Comput. Sci. 348(1): 84-94 (2005) |
| 2004 |
|---|
| 17 | EE | Yoshikazu Shima,
Shinji Mitsuishi,
Kouichi Hirata,
Masateru Harao:
Extracting Minimal and Closed Monotone DNF Formulas.
Discovery Science 2004: 298-305 |
| 16 | EE | Kouichi Hirata,
Takeshi Ogawa,
Masateru Harao:
Generalization Algorithms for Second-Order Terms.
ILP 2004: 147-163 |
| 15 | EE | Kouichi Hirata,
Keizo Yamada,
Masateru Harao:
Tractable and intractable second-order matching problems.
J. Symb. Comput. 37(5): 611-628 (2004) |
| 2003 |
|---|
| 14 | EE | Kouichi Hirata,
Ryosuke Nagazumi,
Masateru Harao:
Extraction of Coverings as Monotone DNF Formulas.
Discovery Science 2003: 166-179 |
| 13 | EE | Kouichi Hirata:
On Condensation of a Clause.
ILP 2003: 164-179 |
| 12 | EE | Hiroshi Sakamoto,
Kouichi Hirata,
Hiroki Arimura:
Learning elementary formal systems with queries.
Theor. Comput. Sci. 1(298): 21-50 (2003) |
| 2001 |
|---|
| 11 | EE | Kouichi Hirata,
Hiroshi Sakamoto:
Prediction-Preserving Reducibility with Membership Queries on Formal Languages.
FCT 2001: 172-183 |
| 2000 |
|---|
| 10 | EE | Kouichi Hirata:
On the Hardness of Learning Acyclic Conjunctive Queries.
ALT 2000: 238-251 |
| 9 | | Noriko Sugimoto,
Takashi Toyoshima,
Shinichi Shimozono,
Kouichi Hirata:
Constructive Learning of Context-Free Languages with a Subpansive Tree.
ICGI 2000: 270-283 |
| 1999 |
|---|
| 8 | EE | Kouichi Hirata:
Flattening and Implication.
ATL 1999: 157-168 |
| 7 | EE | Kouichi Hirata,
Keizo Yamada,
Masateru Harao:
Tractable and Intractable Second-Order Matching Problems.
COCOON 1999: 432-441 |
| 1998 |
|---|
| 6 | EE | Shinichi Shimozono,
Kouichi Hirata,
Ayumi Shinohara:
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
Inf. Process. Lett. 66(4): 165-170 (1998) |
| 1996 |
|---|
| 5 | | Noriko Sugimoto,
Kouichi Hirata,
Hiroki Ishizaka:
Constructive Learning of Translations Based on Dictionaries.
ALT 1996: 177-184 |
| 4 | | Kouichi Hirata,
Shinichi Shimozono,
Ayumi Shinohara:
On the Hardness of Approximating the Minimum Consistent OBDD Problem.
SWAT 1996: 112-123 |
| 3 | | Kouichi Hirata:
Rule-Generating Abduction for Recursive Prolog.
Informatica (Slovenia) 20(1): (1996) |
| 1994 |
|---|
| 2 | | Kouichi Hirata:
Rule-Generating Abduction for Recursive Prolog.
AII/ALT 1994: 121-136 |
| 1993 |
|---|
| 1 | | Kouichi Hirata:
A classification of abduction: abduction for logic programming.
Machine Intelligence 14 1993: 405- |
