default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKouichi Hirata
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c105]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance. ICPRAM 2024: 499-510- [c104]Kouya Kagemoto, Kouichi Hirata:
Activation Functions for Detection of Bacteria from Gram Stained Smears Images by YOLOv8. IIAI-AAI 2024: 1-6 - [c103]Tsubasa Tanaka, Kouichi Hirata:
Comparison with Detection of Bacteria from Gram Stained Smears Images by Various Object Detectors. IIAI-AAI 2024: 58-61 - [c102]Daisuke Abe, Kouichi Hirata:
Ancestral-Path Descendant-Labels Histogram Distance for Rooted Labeled Trees. IIAI-AAI 2024: 72-77 - [c101]Ukyo Kashino, Mayu Yoshida, Kouichi Hirata:
Annotation Along Arranged Bacteria to Detect Gram Positive Cocci from Gram Stained Smears Images. IIAI-AAI 2024: 101-104 - [c100]Ryunosuke Nakajo, Minori Tsutsui, Kouichi Hirata:
Data Augmentation for Detection of Bacteria from Gram Stained Smears Images by YOLOv8. IIAI-AAI 2024: 105-108 - 2023
- [c99]Tomoya Miyazaki, Kouichi Hirata:
Subcaterpillar Isomorphism Between Caterpillars: Subtree Isomorphism Restricted Text and Pattern Trees to Caterpillars. ICPRAM 2023: 89-94 - [c98]Yuichi Shimaya, Kouichi Hirata:
Correlated Mutations of Positions Among Structural Proteins in Delta and Omicron Variants for SARS-CoV-2 Amino Acid Sequences. ICPRAM 2023: 344-349 - [c97]Ukyo Kashino, Syoma Terada, Kouichi Hirata:
Detecting Infectious Disease-Causing Bacteria from Gram Stained Smears Images. IIAI-AAI 2023: 13-18 - [c96]Ryota Nagashima, Uran Yamamoto, Kouichi Hirata:
Distance-Based Analysis of Positions in Amino Acid Sequences for Structural Proteins of SARS-CoV-2 Delta and Omicron Variants. IIAI-AAI 2023: 39-44 - [c95]Hitoshi Sugimoto, Ryotaro Funatsu, Kouichi Hirata:
Predicting Geckler Classification from Gram Stained Smears Images for Sputum: Image Classification versus Object Detection. IIAI-AAI 2023: 122-127 - [c94]Daisuke Abe, Tomoya Miyazaki, Kouichi Hirata:
Sufficient Algorithm for Inclusion of Pattern Caterpillar in Text Tree. IIAI-AAI 2023: 128-131 - 2022
- [c93]Tomoya Miyazaki, Kouichi Hirata
:
Subcaterpillar Isomorphism: Subtree Isomorphism Restricted Pattern Trees To Caterpillars. FedCSIS 2022: 351-356 - [c92]Manami Hagihara, Takuya Yoshino, Kouichi Hirata:
Computing the Variations of Edit Distance for Rooted Labaled Caterpillars. ICPRAM 2022: 272-279 - [c91]Tomoya Miyazaki, Manami Hagihara, Kouichi Hirata:
Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars. ICPRAM 2022: 280-287 - [c90]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Nearest-neighbor Search from Large Datasets using Narrow Sketches. ICPRAM 2022: 401-410 - [c89]Kyohei Yoshihara, Kouichi Hirata:
Object Detection as Campylobacter Bacteria and Phagocytotic Activity of Leukocytes in Gram Stained Smears Images. ICPRAM 2022: 534-541 - [c88]Ibuki Kawano, Eri Kurumida, Syoma Terada, Kouichi Hirata:
Classifying Gram Positive Cocci and Gram Negative Bacilli in Gram Stained Smear Images. IIAI-AAI 2022: 55-60 - [c87]Kan Yonashiro, Yuichi Shimaya, Kouichi Hirata:
Finding Correlated Mutations of Positions among Structural Proteins in SARS-CoV-2 Amino Acid Sequences. IIAI-AAI 2022: 61-64 - [c86]Manami Hagihara, Tomoya Miyazaki, Kouichi Hirata:
Segmental Distance between Rooted Labeled Caterpillars. IIAI-AAI 2022: 107-112 - [c85]Hitoshi Sugimoto, Kouichi Hirata:
Object Detection as Gram Positive Cocci in Gram Stained Smear Images. IIAI-AAI 2022: 134-137 - [c84]Tomoya Miyazaki, Kouichi Hirata:
Subcaterpillar Isomorphism: Subtree Isomorphism for Rooted Labeled Caterpillars. WCO 2022: 110-140 - 2020
- [j15]Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars. J. Inf. Telecommun. 4(2): 199-212 (2020) - [c83]Nozomi Abe, Takuya Yoshino, Kouichi Hirata:
Heavy Caterpillar Distances for Rooted Labeled Unordered Trees. ICPRAM 2020: 198-204 - [c82]Kazuki Hashimoto, Ryosuke Iida, Kouichi Hirata, Kimiko Matsuoka, Shigeki Yokoyama:
Detecting Geckler Classification from Gram Stained Smears Images for Sputum. ICPRAM 2020: 469-476 - [c81]Ryosuke Iida, Kazuki Hashimoto, Kouichi Hirata, Kimiko Matsuoka, Shigeki Yokoyama:
Detection System of Gram Types for Bacteria from Gram Stained Smears Images. ICPRAM 2020: 477-484 - [c80]Naoya Higuchi, Yasunobu Imamura, Vladimir Mic, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Pivot Selection for Narrow Sketches by Optimization Algorithms. SISAP 2020: 33-46
2010 – 2019
- 2019
- [c79]Naoya Higuchi, Yasunobu Imamura, Tetsuji Kuboyama, Kouichi Hirata, Takeshi Shinohara:
Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching. Australasian Conference on Artificial Intelligence 2019: 240-252 - [c78]Yoshiyuki Ukita, Takuya Yoshino, Kouichi Hirata:
Alignment for Rooted Labeled Caterpillars. FedCSIS (Position Papers) 2019: 19-25 - [c77]Naoya Higuchi, Yasunobu Imamura, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Annealing by Increasing Resampling. ICPRAM (Revised Selected Papers) 2019: 71-92 - [c76]Yasunobu Imamura, Naoya Higuchi, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Annealing by Increasing Resampling in the Unified View of Simulated Annealing. ICPRAM 2019: 173-180 - [c75]Naoya Higuchi, Yasunobu Imamura, Tetsuji Kuboyama, Kouichi Hirata, Takeshi Shinohara:
Fast Nearest Neighbor Search with Narrow 16-bit Sketch. ICPRAM 2019: 540-547 - [c74]Kohei Muraka, Takuya Yoshino, Kouichi Hirata:
Vertical and Horizontal Distances to Approximate Edit Distance for Rooted Labeled Caterpillars. ICPRAM 2019: 590-597 - [c73]Mikio Mizukami, Kouichi Hirata, Tetsuji Kuboyama:
Bipartite Edge Correlation Clustering: Finding an Edge Biclique Partition from a Bipartite Graph with Minimum Disagreement. ICPRAM 2019: 699-706 - [c72]Sho Shimamura, Kouichi Hirata:
Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection. TAMC 2019: 550-565 - 2018
- [c71]Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Path Histogram Distance for Rooted Labeled Caterpillars. ACIIDS (1) 2018: 276-286 - [c70]Kohei Muraka, Takuya Yoshino, Kouichi Hirata:
Computing Edit Distance between Rooted Labeled Caterpillars. FedCSIS 2018: 249-255 - [c69]Takuya Yoshino, Kohei Muraka, Kouichi Hirata:
LCA Histogram Distance for Rooted Labeled Caterpillars. KDIR 2018: 305-312 - [c68]Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees. ICPRAM (Revised Selected Papers) 2018: 65-88 - [c67]Taiga Kawaguchi, Kouichi Hirata:
Earth Mover's Distances for Rooted Labaled Unordered Trees based on Tai Mapping Hierarchy. ICPRAM 2018: 159-168 - [c66]Naoya Higuchi, Yasunobu Imamura, Tetsuji Kuboyama, Kouichi Hirata, Takeshi Shinohara:
Nearest Neighbor Search using Sketches as Quantized Images of Dimension Reduction. ICPRAM 2018: 356-363 - 2017
- [j14]Takuya Yoshino, Kouichi Hirata:
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest. Theory Comput. Syst. 60(4): 759-783 (2017) - [c65]Natsuki Kiyota, Sho Shimamura, Kouichi Hirata:
Extracting Mutually Dependent Multisets. DS 2017: 267-280 - [c64]Kouichi Hirata, Takuya Yoshino, Yuma Ishizaka:
Anchored Alignment Distance between Rooted Labeled Unordered Trees. FedCSIS 2017: 433-440 - [c63]Sho Shimamura, Kouichi Hirata:
Iterative Feature Selection Based on Binary Consistency. IIAI-AAI 2017: 397-400 - [c62]Yasunobu Imamura, Naoya Higuchi, Tetsuji Kuboyama, Kouichi Hirata, Takeshi Shinohara:
Pivot Selection for Dimension Reduction using Annealing by Increasing Resampling. LWDA 2017: 15 - 2016
- [c61]Yasunobu Imamura, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Fast Hilbert Sort Algorithm Without Using Hilbert Indices. SISAP 2016: 259-267 - 2015
- [c60]Takuya Yoshino, Kouichi Hirata:
Alignment of Cyclically Ordered Trees. ICPRAM (1) 2015: 263-270 - [c59]Issei Hamada, Takaharu Shimada, Daiki Nakata, Kouichi Hirata, Tetsuji Kuboyama:
Classifying Nucleotide Sequences and their Positions of Influenza A Viruses through Several Kernels. ICPRAM (1) 2015: 342-347 - [c58]Yohei Nasu, Naoki Kishikawa, Kei Tashima, Shin Kodama, Yasunobu Imamura, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree. ICPRAM (1) 2015: 354-359 - [c57]Kazuki Nagayama, Kouichi Hirata, Shigeki Yokoyama, Kimiko Matsuoka:
Extracting Propagation Patterns from Bacterial Culture Data in Medical Facility. JSAI-isAI Workshops 2015: 409-417 - 2014
- [j13]Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata:
Segmental Mapping and Distance for Rooted Labeled Ordered Trees. Fundam. Informaticae 132(4): 461-483 (2014) - [j12]Yoshiyuki Yamamoto, Kouichi Hirata, Tetsuji Kuboyama:
Tractable and Intractable variations of Unordered Tree Edit Distance. Int. J. Found. Comput. Sci. 25(3): 307-330 (2014) - [c56]Yuma Ishizaka, Takuya Yoshino, Kouichi Hirata:
Anchored Alignment Problem for Rooted Labeled Trees. JSAI-isAI Workshops 2014: 296-309 - [c55]Quming Jin, Masaya Nakashima, Takeshi Shinohara, Kouichi Hirata, Tetsuji Kuboyama:
Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization. JSAI-isAI Workshops 2014: 310-316 - [c54]Kouichi Hirata, Tetsuji Kuboyama, Takuya Yoshino:
Mapping Kernels Between Rooted Labeled Trees Beyond Ordered Trees. JSAI-isAI Workshops 2014: 317-330 - 2013
- [c53]Kunihiro Wasa, Takeaki Uno, Kouichi Hirata, Hiroki Arimura:
Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph. Discovery Science 2013: 308-323 - [c52]Masao Hattori, Keiichi Matsumoto, Noriko Sugimoto, Alireza Ahrary, Kouichi Hirata:
Development of Flexible User Need's Investigation System Based on XML Conversions. IIAI-AAI 2013: 125-128 - [c51]Takaharu Shimada, Issei Hamada, Kouichi Hirata, Tetsuji Kuboyama, Kouki Yonezawa, Kimihito Ito:
Clustering of Positions in Nucleotide Sequences by Trim Distance. IIAI-AAI 2013: 129-134 - [c50]Takuya Yoshino, Shoichi Higuchi, Kouichi Hirata:
A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance. IIAI-AAI 2013: 135-140 - [c49]Issei Hamada, Takaharu Shimada, Daiki Nakata, Kouichi Hirata, Tetsuji Kuboyama:
Agreement Subtree Mapping Kernel for Phylogenetic Trees. JSAI-isAI Workshops 2013: 321-336 - [c48]Shoichi Higuchi, Tetsuji Kuboyama, Takako Hashimoto, Kouichi Hirata:
Exploring social context from buzz marketing site - Community mapping based on tree edit distance -. PerCom Workshops 2013: 187-192 - [c47]Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura:
Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. SISAP 2013: 73-84 - 2012
- [c46]Shunsuke Makino, Takaharu Shimada, Kouichi Hirata, Kouki Yonezawa, Kimihito Ito:
A Trim Distance between Positions in Nucleotide Sequences. Discovery Science 2012: 81-94 - [c45]Noriko Sugimoto, Kouichi Hirata:
Translating XML Documents Through Dyck-Typed Regular Translation Elementary Formal Systems. IIAI-AAI 2012: 218-223 - [c44]Takahiro Hokazono, Tomohiro Kan, Yoshiyuki Yamamoto, Kouichi Hirata:
An Isolated-Subtree Inclusion for Unordered Trees. IIAI-AAI 2012: 345-350 - [c43]Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata:
Segmental Mapping and Distance for Rooted Labeled Ordered Trees. ISAAC 2012: 485-494 - [c42]Takaharu Shimada, Tatsuya Hazemoto, Shunsuke Makino, Kouichi Hirata, Kimihito Ito:
Finding correlated mutations among RNA segments in H3N2 influenza viruses. SCIS&ISIS 2012: 1696-1701 - [c41]Shunsuke Makino, Takaharu Shimada, Kouichi Hirata, Kouki Yonezawa, Kimihito Ito:
A trim distance between positions as packaging signals in H3N2 influenza viruses. SCIS&ISIS 2012: 1702-1707 - 2011
- [c40]Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama:
Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. CPM 2011: 402-415 - [c39]Shoichi Higuchi, Tomohiro Kan, Yoshiyuki Yamamoto, Kouichi Hirata:
An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees. JSAI-isAI Workshops 2011: 186-196 - [c38]Yoshiyuki Yamamoto, Kouichi Hirata, Tetsuji Kuboyama:
On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms. JSAI-isAI Workshops 2011: 211-223 - 2010
- [j11]Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama:
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. Fundam. Informaticae 101(3): 157-171 (2010) - [j10]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
An Efficient Depth-first Search Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. Inf. Media Technol. 5(2): 459-470 (2010)
2000 – 2009
- 2009
- [c37]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
Mining Frequent Bipartite Episode from Event Sequences. Discovery Science 2009: 136-151 - [c36]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 - [c35]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
Mining Frequent k-Partite Episodes from Event Sequences. JSAI-isAI Workshops 2009: 331-344 - [c34]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 - [c33]Takashi Katoh, Hiroki Arimura, Kouichi Hirata:
A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. PAKDD 2009: 172-183 - [c32]Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama:
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. SOFSEM 2009: 93-104 - [c31]Taishin Daigo, Kouichi Hirata:
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay. SOFSEM 2009: 181-192 - 2008
- [c30]Arnoldo José Müller Molina, Kouichi Hirata, Takeshi Shinohara:
A Tree Distance Function Based on Multi-sets. PAKDD Workshops 2008: 87-98 - [c29]Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama:
Sibling Distance for Rooted Labeled Trees. PAKDD Workshops 2008: 99-110 - [c28]Tetsuji Kuboyama, Kouichi Hirata, Kiyoko F. Aoki-Kinoshita:
An Efficient Unordered Tree Kernel and Its Application to Glycan Classification. PAKDD 2008: 184-195 - [c27]Takashi Katoh, Kouichi Hirata:
A Simple Characterization on Serially Constructible Episodes. PAKDD 2008: 600-607 - 2007
- [j9]Tetsuji Kuboyama, Kouichi Hirata, Hisashi Kashima, Kiyoko F. Aoki-Kinoshita, Hiroshi Yasuda:
A Spectrum Tree Kernel. Inf. Media Technol. 2(1): 292-299 (2007) - [j8]Kengo Kubo, Keizo Yamada, Kouichi Hirata, Masateru Harao:
Efficient schema matching algorithm based on pre-checking. Syst. Comput. Jpn. 38(4): 84-92 (2007) - [c26]Akihiro Yamamoto, Kouichi Hirata:
The Fifth Workshop on Learning with Logics and Logics for Learning (LLLL2007). JSAI 2007: 305-306 - [c25]Takashi Katoh, Kouichi Hirata, Masateru Harao:
Mining Frequent Diamond Episodes from Event Sequences. MDAI 2007: 477-488 - 2006
- [j7]Eiju Hirowatari, Kouichi Hirata, Tetsuhiro Miyahara, Setsuo Arikawa:
Refutability and Reliability for Inductive Inference of Recursive Real-Valued Functions. Inf. Media Technol. 1(1): 33-44 (2006) - [c24]Takashi Katoh, Kouichi Hirata, Masateru Harao:
Mining Sectorial Episodes from Event Sequences. Discovery Science 2006: 137-148 - [c23]Akihiro Yamamoto, Kouichi Hirata, Ken Satoh:
The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006). JSAI 2006: 249-250 - 2005
- [j6]Kouichi Hirata:
Prediction-hardness of acyclic conjunctive queries. Theor. Comput. Sci. 348(1): 84-94 (2005) - [c22]Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao:
The q-Gram Distance for Ordered Unlabeled Trees. Discovery Science 2005: 189-202 - [c21]Kouichi Hirata, Megumi Kuwabara, Masateru Harao:
On Finding Acyclic Subhypergraphs. FCT 2005: 491-503 - [c20]Kosuke Ono, Masateru Harao, Kouichi Hirata:
Multi-Agent Based Modeling and Simulation of Consensus Formations in Arguments. ICITA (1) 2005: 264-267 - [c19]Shogo Ozaki, Masateru Harao, Kouichi Hirata:
Performance Analysis for Construction of a Performance Practice Support System. ICITA (2) 2005: 415-418 - [c18]Akihiro Yamamoto, Kouichi Hirata:
Workshop on Learning with Logics and Logics for Learning (LLLL). JSAI Workshops 2005: 167-168 - [c17]Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao:
On Generalization and Subsumption for Ordered Clauses. JSAI Workshops 2005: 212-223 - [c16]Eiju Hirowatari, Kouichi Hirata, Tetsuhiro Miyahara:
Prediction of Recursive Real-Valued Functions from Finite Examples. JSAI Workshops 2005: 224-234 - [c15]Kosuke Ono, Takashi Hata, Toyofumi Maetani, Masateru Harao, Kouichi Hirata:
Development of a Multi-Agent Based Generic Traffic Simulator. JSAI Workshops 2005: 249-260 - [c14]Yoshikazu Shima, Kouichi Hirata, Masateru Harao:
Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning. PAKDD 2005: 50-60 - 2004
- [j5]Kouichi Hirata, Keizo Yamada, Masateru Harao:
Tractable and intractable second-order matching problems. J. Symb. Comput. 37(5): 611-628 (2004) - [c13]Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata, Masateru Harao:
Extracting Minimal and Closed Monotone DNF Formulas. Discovery Science 2004: 298-305 - [c12]Kouichi Hirata, Takeshi Ogawa, Masateru Harao:
Generalization Algorithms for Second-Order Terms. ILP 2004: 147-163 - 2003
- [j4]Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura:
Learning elementary formal systems with queries. Theor. Comput. Sci. 298(1): 21-50 (2003) - [c11]Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao:
Extraction of Coverings as Monotone DNF Formulas. Discovery Science 2003: 166-179 - [c10]Kouichi Hirata:
On Condensation of a Clause. ILP 2003: 164-179 - 2001
- [c9]Kouichi Hirata, Hiroshi Sakamoto:
Prediction-Preserving Reducibility with Membership Queries on Formal Languages. FCT 2001: 172-183 - 2000
- [c8]Kouichi Hirata:
On the Hardness of Learning Acyclic Conjunctive Queries. ALT 2000: 238-251 - [c7]Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata:
Constructive Learning of Context-Free Languages with a Subpansive Tree. ICGI 2000: 270-283
1990 – 1999
- 1999
- [c6]Kouichi Hirata:
Flattening and Implication. ALT 1999: 157-168 - [c5]Kouichi Hirata, Keizo Yamada, Masateru Harao:
Tractable and Intractable Second-Order Matching Problems. COCOON 1999: 432-441 - 1998
- [j3]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) - 1997
- [j2]Kouichi Hirata:
Constructing Simply Recursive Programs from a Finite Set of Good Examples. Inf. Process. Lett. 64(5): 225-230 (1997) - 1996
- [j1]Kouichi Hirata:
Rule-Generating Abduction for Recursive Prolog. Informatica (Slovenia) 20(1) (1996) - [c4]Noriko Sugimoto, Kouichi Hirata, Hiroki Ishizaka:
Constructive Learning of Translations Based on Dictionaries. ALT 1996: 177-184 - [c3]Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara:
On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123 - 1994
- [c2]Kouichi Hirata:
Rule-Generating Abduction for Recursive Prolog. AII/ALT 1994: 121-136 - 1993
- [c1]Kouichi Hirata:
A classification of abduction: abduction for logic programming. Machine Intelligence 14 1993: 405-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
