Polynomial Time Inference of Extended Regular Pattern Languages. - Takeshi Shinohara (RIMS Symposium on Software Science and Engineering, 1982)

GENAS: a database system for nucleic acid sequence analysis. - Satoru Kuhara; Fumihiro Matsuo; Syoichi Futamura; Atsushi Fujita; Takeshi Shinohara; Toshihisa Takagi; Yoshiyuki Sakaki (Nucleic Acids Res., 1984)

A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines. - Setsuo Arikawa; Takeshi Shinohara (New Gener. Comput., 1984)

Some problems on inductive inference from positive data. - Takeshi Shinohara (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

Efficient pattern matching algorithms and their applications to text information systems. - Setsuo Arikawa; Takeshi Shinohara (RIAO, 1985)

Efficient Storage and Retrieval of Very Large Document Databases. - Fumihiro Matsuo; Shouichi Futamura; Takeshi Shinohara (ICDE, 1986)

Elementary Formal System as a Unifying Framework for Language Learning. - Setsuo Arikawa; Takeshi Shinohara; Akihiro Yamamoto (COLT, 1989)

Inductive Inference from Positive Data is Powerful. - Takeshi Shinohara (COLT, 1990)

Polynomial-time inference of unions of tree pattern languages. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (ALT, 1991)

Which classes of elementary formal systems are polynomial-time learnable. - Satoru Miyano; Ayumi Shinohara; Takeshi Shinohara (ALT, 1991)

The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. - Tatsuya Motoki; Takeshi Shinohara; Keith Wright (COLT, 1991)

More About Learning Elementary Formal Systems. - Setsuo Arikawa; Takeshi Shinohara; Satoru Miyano; Ayumi Shinohara (Nonmonotonic and Inductive Logic, 1991)

A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (Nonmonotonic and Inductive Logic, 1991)

Inductive Inference of Monotonic Formal Systems from Positive Data. - Takeshi Shinohara (New Gener. Comput., 1991)

Efficient Inductive Inference of Primitive Prologs from Positive Data. - Hiroki Ishizaka; Hiroki Arimura; Takeshi Shinohara (ALT, 1992)

Polynomial Time Inference of a Subclass of Context-Free Transformations. - Hiroki Arimura; Hiroki Ishizaka; Takeshi Shinohara (COLT, 1992)

A Generalization of the Least General Generalization. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki; Hiroki Ishizaka (Machine Intelligence 13, 1992)

Learning Elementary Formal Systems. - Setsuo Arikawa; Takeshi Shinohara; Akihiro Yamamoto (Theor. Comput. Sci., 1992)

A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. - Setsuo Arikawa; Satoru Miyano; Ayumi Shinohara; Satoru Kuhara; Yasuhito Mukouchi; Takeshi Shinohara (New Gener. Comput., 1993)

Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data. - Hiroki Arimura; Takeshi Shinohara; Setsuko Otsuki (STACS, 1994)

Special Issue on Algorithmic Learning Theory. - Koichi Furukawa; Takeshi Shinohara; Yuji Takada (New Gener. Comput., 1994)

Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems - Takeshi Shinohara (Inf. Comput., 1994)

Editor's Introduction. - Klaus P. Jantke; Takeshi Shinohara; Thomas Zeugmann (ALT, 1995)

Pattern Inference. - Takeshi Shinohara; Setsuo Arikawa (GOSLER Final Report, 1995)

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. - Takayoshi Shoudai; Michael Lappe; Satoru Miyano; Ayumi Shinohara; Takeo Okazaki; Setsuo Arikawa; Tomoyuki Uchida; Shinichi Shimozono; Takeshi Shinohara; Satoru Kuhara (ISMB, 1995)

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. - Setsuo Arikawa; Masako Sato; Ayumi Shinohara; Takeshi Shinohara (Machine Intelligence 15, 1995)

Learning Unions of Tree Patterns Using Queries. - Hiroki Arimura; Hiroki Ishizaka; Takeshi Shinohara (Theor. Comput. Sci., 1997)

Approximate Retrieval of High-Dimensional Data by Spatial Indexing. - Takeshi Shinohara; Jiyuan An; Hiroki Ishizaka (Discovery Science, 1998)

Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries. - Hiroki Ishizaka; Hiroki Arimura; Takeshi Shinohara (Ann. Math. Artif. Intell., 1998)

H-Map: A Dimension Reduction Mapping for Approximate Retrieval of Multi-dimensional Data. - Takeshi Shinohara; Jianping Chen; Hiroki Ishizaka (Discovery Science, 1999)

Speeding Up Pattern Matching by Text Compression. - Yusuke Shibata; Takuya Kida; Shuichi Fukamachi; Masayuki Takeda; Ayumi Shinohara; Takeshi Shinohara; Setsuo Arikawa (CIAC, 2000)

Collaboration with Lean Media: how open-source software succeeds. - Yutaka Yamauchi; Makoto Yokozawa; Takeshi Shinohara; Toru Ishida 001 (CSCW, 2000)

Speed-Up of Approximate String Matching Using Lossy Compression. - Shuichi Fukamachi; Takeshi Shinohara (EJC, 2000)

Polynomial-time Learning of Elementary Formal Systems. - Satoru Miyano; Ayumi Shinohara; Takeshi Shinohara (New Gener. Comput., 2000)

Approximate Retrieval of High-Dimensional Date with L1 Metric by Spacial Indexing. - Takeshi Shinohara; Jiyuan An; Hiroki Ishizaka (New Gener. Comput., 2000)

Inductive inference of unbounded unions of pattern languages from positive data. - Takeshi Shinohara; Hiroki Arimura (Theor. Comput. Sci., 2000)

An Efficient Derivation for Elementary Formal Systems Based on Partial Unification. - Noriko Sugimoto; Hiroki Ishizaka; Takeshi Shinohara (Discovery Science, 2001)

Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States. - T. Nishimura; Shuichi Fukamachi; Takeshi Shinohara (SPIRE, 2001)

On Dimension Reduction Mappings for Approximate Retrieval of Multi-dimensional Data. - Takeshi Shinohara; Hiroki Ishizaka (Progress in Discovery Science, 2002)

Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. - Masayuki Takeda; Satoru Miyamoto; Takuya Kida; Ayumi Shinohara; Shuichi Fukamachi; Takeshi Shinohara; Setsuo Arikawa (SPIRE, 2002)

Model Analysis of Digital Copyright Piracy on P2P Networks. - Yoichiro Itakura; Makoto Yokozawa; Takeshi Shinohara (SAINT Workshops, 2004)

Inferring Unions of the Pattern Languages by the Most Fitting Covers. - Yen Kaow Ng; Takeshi Shinohara (ALT, 2005)

Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. - Yen Kaow Ng; Hirotaka Ono 001; Takeshi Shinohara (Discovery Science, 2005)

On approximate matching of programs for protecting libre software. - Arnoldo José Müller Molina; Takeshi Shinohara (CASCON, 2006)

Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses. - Yen Kaow Ng; Takeshi Shinohara (ICGI, 2006)

Finding Consensus Patterns in Very Scarce Biosequence Samples from Their Minimal Multiple Generalizations. - Yen Kaow Ng; Takeshi Shinohara (PAKDD, 2006)

Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes. - Arnoldo José Müller Molina; Takeshi Shinohara (SCAM, 2007)

A Tree Distance Function Based on Multi-sets. - Arnoldo José Müller Molina; Kouichi Hirata; Takeshi Shinohara (PAKDD Workshops, 2008)

Foreword. - John Case; Takeshi Shinohara; Thomas Zeugmann; Sandra Zilles (Theor. Comput. Sci., 2008)

Developments from enquiries into the learnability of the pattern languages from positive data. - Yen Kaow Ng; Takeshi Shinohara (Theor. Comput. Sci., 2008)

Efficient Similarity Search by Reducing I/O with Compressed Sketches. - Arnoldo José Müller Molina; Takeshi Shinohara (SISAP, 2009)

Towards Low Carbon Similarity Search with Compressed Sketches. - Arnoldo José Müller Molina; Takeshi Shinohara (VLDB PhD Workshop, 2009)

Accelerating Video Identification by Skipping Queries with a Compact Metric Cache. - Takaaki Aoki; Daisuke Ninomiya; Arnoldo José Müller Molina; Takeshi Shinohara (ICCSA (4), 2010)

On the Configuration of the Similarity Search Data Structure D-Index for High Dimensional Objects. - Arnoldo José Müller Molina; Takeshi Shinohara (ICCSA (3), 2010)

Central Point Selection in Dimension Reduction Projection Simple-Map with Binary Quantization. - Quming Jin; Masaya Nakashima; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (JSAI-isAI Workshops, 2014)

High Dimensional Similarity Search with Bundled Query Processing on Hilbert R-Tree. - Yohei Nasu; Naoki Kishikawa; Kei Tashima; Shin Kodama; Yasunobu Imamura; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (ICPRAM (1), 2015)

Fast Hilbert Sort Algorithm Without Using Hilbert Indices. - Yasunobu Imamura; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (SISAP, 2016)

Pivot Selection for Dimension Reduction using Annealing by Increasing Resampling. - Yasunobu Imamura; Naoya Higuchi; Tetsuji Kuboyama; Kouichi Hirata; Takeshi Shinohara (LWDA, 2017)

Nearest Neighbor Search using Sketches as Quantized Images of Dimension Reduction. - Naoya Higuchi; Yasunobu Imamura; Tetsuji Kuboyama; Kouichi Hirata; Takeshi Shinohara (ICPRAM, 2018)

Fast Filtering for Nearest Neighbor Search by Sketch Enumeration Without Using Matching. - Naoya Higuchi; Yasunobu Imamura; Tetsuji Kuboyama; Kouichi Hirata; Takeshi Shinohara (Australasian Conference on Artificial Intelligence, 2019)

Fast Nearest Neighbor Search with Narrow 16-bit Sketch. - Naoya Higuchi; Yasunobu Imamura; Tetsuji Kuboyama; Kouichi Hirata; Takeshi Shinohara (ICPRAM, 2019)

Annealing by Increasing Resampling. - Naoya Higuchi; Yasunobu Imamura; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (ICPRAM (Revised Selected Papers), 2019)

Annealing by Increasing Resampling in the Unified View of Simulated Annealing. - Yasunobu Imamura; Naoya Higuchi; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (ICPRAM, 2019)

Pivot Selection for Narrow Sketches by Optimization Algorithms. - Naoya Higuchi; Yasunobu Imamura; Vladimir Mic; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (SISAP, 2020)

Nearest-neighbor Search from Large Datasets using Narrow Sketches. - Naoya Higuchi; Yasunobu Imamura; Vladimir Mic; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (ICPRAM, 2022)

Fast Filtering for Similarity Search Using Conjunctive Enumeration of Sketches in Order of Hamming Distance. - Naoya Higuchi; Yasunobu Imamura; Vladimir Mic; Takeshi Shinohara; Kouichi Hirata; Tetsuji Kuboyama (ICPRAM, 2024)