| 2011 | ||
|---|---|---|
| 45 | Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama: Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. CPM 2011: 402-415 | |
| 2010 | ||
| 44 | Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama: Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. Fundam. Inform. 101(3): 157-171 (2010) | |
| 2009 | ||
| 43 | Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent Bipartite Episode from Event Sequences. Discovery Science 2009: 136-151 | |
| 42 | Akihiro Yamamoto, Kouichi Hirata, Shin-ichi Minato: The Sixth Workshop on Learning with Logics and Logics for Learning (LLLL2009). JSAI-isAI Workshops 2009: 315-316 | |
| 41 | Takashi Katoh, Hiroki Arimura, Kouichi Hirata: Mining Frequent k-Partite Episodes from Event Sequences. JSAI-isAI Workshops 2009: 331-344 | |
| 40 | Kazuya Sata, Kouichi Hirata, Kimihito Ito, Tetsuji Kuboyama: Discovering Networks for Global Propagation of Influenza A (H3N2) Viruses by Clustering. KES (2) 2009: 490-497 | |
| 39 | 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 | Taishin Daigo, Kouichi Hirata: On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay. SOFSEM 2009: 181-192 | |
| 37 | Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama: Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. SOFSEM 2009: 93-104 | |
| 2008 | ||
| 36 | Tetsuji Kuboyama, Kouichi Hirata, Kiyoko F. Aoki-Kinoshita: An Efficient Unordered Tree Kernel and Its Application to Glycan Classification. PAKDD 2008: 184-195 | |
| 35 | Takashi Katoh, Kouichi Hirata: A Simple Characterization on Serially Constructible Episodes. PAKDD 2008: 600-607 | |
| 34 | Arnoldo José Müller Molina, Kouichi Hirata, Takeshi Shinohara: A Tree Distance Function Based on Multi-sets. PAKDD Workshops 2008: 87-98 | |
| 33 | Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama: Sibling Distance for Rooted Labeled Trees. PAKDD Workshops 2008: 99-110 | |
| 2007 | ||
| 32 | Akihiro Yamamoto, Kouichi Hirata: The Fifth Workshop on Learning with Logics and Logics for Learning (LLLL2007). JSAI 2007: 305-306 | |
| 31 | Takashi Katoh, Kouichi Hirata, Masateru Harao: Mining Frequent Diamond Episodes from Event Sequences. MDAI 2007: 477-488 | |
| 30 | 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 | Takashi Katoh, Kouichi Hirata, Masateru Harao: Mining Sectorial Episodes from Event Sequences. Discovery Science 2006: 137-148 | |
| 28 | Akihiro Yamamoto, Kouichi Hirata, Ken Satoh: The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006). JSAI 2006: 249-250 | |
| 2005 | ||
| 27 | Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao: The q-Gram Distance for Ordered Unlabeled Trees. Discovery Science 2005: 189-202 | |
| 26 | Kouichi Hirata, Megumi Kuwabara, Masateru Harao: On Finding Acyclic Subhypergraphs. FCT 2005: 491-503 | |
| 25 | Kosuke Ono, Masateru Harao, Kouichi Hirata: Multi-Agent Based Modeling and Simulation of Consensus Formations in Arguments. ICITA (1) 2005: 264-267 | |
| 24 | Shogo Ozaki, Masateru Harao, Kouichi Hirata: Performance Analysis for Construction of a Performance Practice Support System. ICITA (2) 2005: 415-418 | |
| 23 | Akihiro Yamamoto, Kouichi Hirata: Workshop on Learning with Logics and Logics for Learning (LLLL). JSAI Workshops 2005: 167-168 | |
| 22 | Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao: On Generalization and Subsumption for Ordered Clauses. JSAI Workshops 2005: 212-223 | |
| 21 | Eiju Hirowatari, Kouichi Hirata, Tetsuhiro Miyahara: Prediction of Recursive Real-Valued Functions from Finite Examples. JSAI Workshops 2005: 224-234 | |
| 20 | 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 | Yoshikazu Shima, Kouichi Hirata, Masateru Harao: Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning. PAKDD 2005: 50-60 | |
| 18 | Kouichi Hirata: Prediction-hardness of acyclic conjunctive queries. Theor. Comput. Sci. 348(1): 84-94 (2005) | |
| 2004 | ||
| 17 | Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata, Masateru Harao: Extracting Minimal and Closed Monotone DNF Formulas. Discovery Science 2004: 298-305 | |
| 16 | Kouichi Hirata, Takeshi Ogawa, Masateru Harao: Generalization Algorithms for Second-Order Terms. ILP 2004: 147-163 | |
| 15 | Kouichi Hirata, Keizo Yamada, Masateru Harao: Tractable and intractable second-order matching problems. J. Symb. Comput. 37(5): 611-628 (2004) | |
| 2003 | ||
| 14 | Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao: Extraction of Coverings as Monotone DNF Formulas. Discovery Science 2003: 166-179 | |
| 13 | Kouichi Hirata: On Condensation of a Clause. ILP 2003: 164-179 | |
| 12 | Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura: Learning elementary formal systems with queries. Theor. Comput. Sci. 1(298): 21-50 (2003) | |
| 2001 | ||
| 11 | Kouichi Hirata, Hiroshi Sakamoto: Prediction-Preserving Reducibility with Membership Queries on Formal Languages. FCT 2001: 172-183 | |
| 2000 | ||
| 10 | 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 | Kouichi Hirata: Flattening and Implication. ATL 1999: 157-168 | |
| 7 | Kouichi Hirata, Keizo Yamada, Masateru Harao: Tractable and Intractable Second-Order Matching Problems. COCOON 1999: 432-441 | |
| 1998 | ||
| 6 | 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- | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page