| 2013 | ||
|---|---|---|
| j20 | Satoshi Murata, Akihiko Konagaya, Satoshi Kobayashi, Hirohide Saito, Masami Hagiya: Molecular Robotics: A New Paradigm for Artifacts. New Generation Comput. 31(1): 27-45 (2013) | |
| 2012 | ||
| j19 | Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: Reaction automata. Theor. Comput. Sci. 429: 247-257 (2012) | |
| j18 | Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: On the properties of language classes defined by bounded reaction automata. Theor. Comput. Sci. 454: 206-221 (2012) | |
| c32 | Yoshitaka Minami, Hideaki Takeda, Fumihiro Kato, Ikki Ohmukai, Noriko Arai, Utsugi Jinbo, Motomi Ito, Satoshi Kobayashi, Shoko Kawamoto: Towards a Data Hub for Biodiversity with LOD. JIST 2012: 356-361 | |
| c31 | Hiroki Kashiwazaki, Satoshi Kobayashi, Shugo Kawai, Norikatsu Ohishi, Yoshiaki Takai: An Adaptive Approach for Network Traffic Load Balancing by Using One-Way Delay. SAINT 2012: 345-350 | |
| i2 | Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: On the Properties of Language Classes Defined by Bounded Reaction Automata. CoRR abs/1201.3082 (2012) | |
| 2011 | ||
| i1 | ||
| 2010 | ||
| c30 | Yuji Numai, Satoshi Kobayashi: Efficient State Minimization Algorithm of Linear Separation Automata. PDPTA 2010: 633-639 | |
| 2009 | ||
| j17 | Cristina Tîrnauca, Satoshi Kobayashi: Necessary and sufficient conditions for learning with correction queries. Theor. Comput. Sci. 410(47-49): 5145-5157 (2009) | |
| 2008 | ||
| c29 | Satoshi Kobayashi: A New Translation for Semi-classical Theories - Backtracking without CPS. FLOPS 2008: 210-223 | |
| 2007 | ||
| c28 | Yasubumi Sakakibara, Takashi Yokomori, Satoshi Kobayashi, Akira Suyama: Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles. Formal Models, Languages and Applications 2007: 304-319 | |
| c27 | Kazuya Ogasawara, Satoshi Kobayashi: Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation. LATA 2007: 461-472 | |
| c26 | Cristina Tîrnauca, Satoshi Kobayashi: A Characterization of the Language Classes Learnable with Correction Queries. TAMC 2007: 398-407 | |
| 2006 | ||
| c25 | Hendry Muljadi, Hideaki Takeda, Aman Shakya, Shoko Kawamoto, Satoshi Kobayashi, Asao Fujiyama, Koichi Ando: Semantic Wiki as a Lightweight Knowledge Management System. ASWC 2006: 65-71 | |
| c24 | Hendry Muljadi, Hideaki Takeda, Shoko Kawamoto, Satoshi Kobayashi, Asao Fujiyama: Towards a Semantic Wiki-Based Japanese Biodictionary. SemWiki 2006 | |
| p1 | Satoshi Kobayashi: Mathematical Foundations of Learning Theory. Recent Advances in Formal Languages and Applications 2006: 209-228 | |
| e1 | Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita (Eds.): Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings. Lecture Notes in Computer Science 4201, Springer 2006, isbn 3-540-45264-8 | |
| 2005 | ||
| j16 | Shinnosuke Seki, Satoshi Kobayashi: A Grammatical Approach to the Alignment of Structure-Annotated Strings. IEICE Transactions 88-D(12): 2727-2737 (2005) | |
| c23 | Atsushi Kijima, Satoshi Kobayashi: Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences. DNA 2005: 171-180 | |
| 2004 | ||
| c22 | Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. Aspects of Molecular Computing 2004: 266-277 | |
| c21 | Satoshi Kobayashi: Testing Structure Freeness of Regular Sets of Biomolecular Sequences. DNA 2004: 192-201 | |
| c20 | Shinnosuke Seki, Satoshi Kobayashi: Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples. ICGI 2004: 285-287 | |
| 2002 | ||
| j15 | Masanori Arita, Satoshi Kobayashi: DNA Sequence Design Using Templates. New Generation Comput. 20(3): 263-278 (2002) | |
| c19 | Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi: A Magic Pot : Self-assembly Computation Revisited. Formal and Natural Computing 2002: 418-430 | |
| c18 | Satoshi Kobayashi, Tomohiro Kondo, Masanori Arita: On Template Method for DNA Sequence Design. DNA 2002: 205-214 | |
| c17 | Kouichi Katsurada, Yoshihiko Ootani, Yusaku Nakamura, Satoshi Kobayashi, Hirobumi Yamada, Tsuneo Nitta: A modality-independent MMI system architecture. INTERSPEECH 2002 | |
| 2001 | ||
| j14 | Yasubumi Sakakibara, Satoshi Kobayashi: Sticker systems with complex structures. Soft Comput. 5(2): 114-120 (2001) | |
| j13 | Satoshi Kobayashi, Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg: Formal properties of PA-matching. Theor. Comput. Sci. 262(1): 117-131 (2001) | |
| j12 | Satoshi Kobayashi, Yasubumi Sakakibara: Multiple splicing systems and the universal computability. Theor. Comput. Sci. 264(1): 3-23 (2001) | |
| c16 | Satoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori: Approximate identification of finite elasticity. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 277-286 | |
| c15 | Hiroki Uejima, Masami Hagiya, Satoshi Kobayashi: Horn Clause Computation by Self-assembly of DNA Molecules. DNA 2001: 308-320 | |
| c14 | Tsuneo Nitta, Kouichi Katsurada, Hirobumi Yamada, Yusaku Nakamura, Satoshi Kobayashi: XISL: an attempt to separate multimodal interactions from XML contents. INTERSPEECH 2001: 1197-1200 | |
| c13 | Takashi Tanaka, Kazumasa Mori, Satoshi Kobayashi, Seiichi Nakagawa: Automatic construction of CALL system from TV news program with captions. INTERSPEECH 2001: 2815-2818 | |
| 2000 | ||
| j11 | Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori: On the universality of Post and splicing systems. Theor. Comput. Sci. 231(2): 157-170 (2000) | |
| c12 | Satoshi Kobayashi: Iterated Transductions and Efficient Learning from Positive Data: A Unifying View. ICGI 2000: 157-170 | |
| 1999 | ||
| j10 | Satoshi Kobayashi: Horn Clause Computation with DNA Molecules. J. Comb. Optim. 3(2-3): 277-299 (1999) | |
| j9 | Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi, Takashi Yokomori: Tree Adjoining Grammars for RNA Structure Prediction. Theor. Comput. Sci. 210(2): 277-303 (1999) | |
| 1998 | ||
| j8 | Takashi Yokomori, Satoshi Kobayashi: Learning Local Languages and Their Application to DNA Sequence Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 20(10): 1067-1079 (1998) | |
| c11 | Tom Head, Satoshi Kobayashi, Takashi Yokomori: Locality, Reversibility, and Beyond: Learning Languages from Positive Data. ALT 1998: 191-204 | |
| c10 | Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori: On the Universality of Post and Splicing Systems. MCU (2) 1998: 12-28 | |
| 1997 | ||
| j7 | Satoshi Kobayashi, Takashi Yokomori: Learning Approximately Regular Languages with Reversible Languages. Theor. Comput. Sci. 174(1-2): 251-257 (1997) | |
| j6 | ||
| c9 | Satoshi Kobayashi, Takashi Yokomori: Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. ALT 1997: 48-61 | |
| c8 | Shigeyoshi Kitazawa, Hideya Ichikawa, Satoshi Kobayashi, Yukihiro Nishinuma: Extraction and representation rhythmic components of spontaneous speech. EUROSPEECH 1997 | |
| 1996 | ||
| j5 | Susumu Hayashi, Masakazu Ishikawa, Satoshi Kobayashi, Hiroshi Nakano, Syuichi Nakazaki: Two Extensions of PX system. Electr. Notes Theor. Comput. Sci. 3: 88 (1996) | |
| j4 | Satoshi Kobayashi, Takashi Yokomori: Families of Noncounting Languages and Their Learnability from Positive Data. Int. J. Found. Comput. Sci. 7(4): 309-328 (1996) | |
| 1995 | ||
| j3 | Satoshi Kobayashi: Identifying Strategies Using Decision Lists from Trace Information. IEICE Transactions 78-D(5): 545-552 (1995) | |
| c7 | Satoshi Kobayashi, Takashi Yokomori: On Approximately Identifying Concept Classes in the Limit. ALT 1995: 298-312 | |
| c6 | Satoshi Kobayashi, Shigeyoshi Kitazawa: Consistency of inter-transcribers' transcription. EUROSPEECH 1995 | |
| 1994 | ||
| j2 | Satoshi Kobayashi, Makoto Tatsuta: Realizability Interpretation of Generalized Inductive Definitions. Theor. Comput. Sci. 131(1): 121-138 (1994) | |
| c5 | Satoshi Kobayashi, Takashi Yokomori: Learning Concatenations of Locally Testable Languages from Positive Data. AII/ALT 1994: 407-422 | |
| c4 | Takashi Yokomori, Nobuyuki Ishida, Satoshi Kobayashi: Learning Local Languages and its Application to Protein \alpha-Chain Identification. HICSS (5) 1994: 113-122 | |
| c3 | Shigeyoshi Kitazawa, Satoshi Kobayashi, Takao Matsunaga, Hideya Ichikawa: Tempo estimation by wave envelope for recognition of paralinguistic features in spontaneous speech. ICSLP 1994 | |
| 1993 | ||
| c2 | ||
| c1 | Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga: Learning Decision Lists over Tree Patterns and Its Application. IJCAI 1993: 995-1001 | |
| 1992 | ||
| j1 | Satoshi Kobayashi, Setsuo Ohsuga, Koichi Hori, Toshiyuki Yamauchi: A method of acquiring strategies and classifying knowledge from trace data. Systems and Computers in Japan 23(5): 83-93 (1992) | |
Colors in the list of coauthors
Last update Sun May 19 04:08:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page