Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ayumi Shinohara
2010 – today
- 2013
[c78]Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga: Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291- [i3]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara: Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013)
- 2012
- [c77]Junya Saito, Kazuyuki Narisawa, Ayumi Shinohara: Prediction for Control Delay on Reinforcement Learning. ICAART (1) 2012: 579-586
- [c76]Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara: Functional programs as compressed data. PEPM 2012: 121-130
- [c75]Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara: Computing Maximum Number of Runs in Strings. SPIRE 2012: 318-329
- 2010
- [j22]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara: An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chicago J. Theor. Comput. Sci. 2010 (2010)
- [c74]
- [c73]Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Inferring Strings from Runs. Stringology 2010: 150-160
- [c72]Kazuhiko Kusano, Ayumi Shinohara: Average Number of Runs and Squares in Necklace. Stringology 2010: 167-177
- [c71]Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson: The Number of Runs in a Ternary Word. Stringology 2010: 178-181
2000 – 2009
- 2009
- [j21]Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Text Compression by Longest-First Substitution. Algorithms 2(4): 1429-1448 (2009)
- [j20]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Joshua Gramm, Akira Ishino, Ayumi Shinohara: Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots. IEICE Transactions 92-D(9): 1752-1761 (2009)
- [j19]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Average Value of Sum of Exponents of Runs in a String. Int. J. Found. Comput. Sci. 20(6): 1135-1146 (2009)
- [j18]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009)
- [c70]Tatsuya Kasai, Hayato Kobayashi, Ayumi Shinohara: Improvement of the performance using received message on learning of communication codes. AAMAS (2) 2009: 1229-1230
- [c69]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara: Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS 2009: 19-28
- [c68]Hayato Kobayashi, Ayumi Shinohara: Complexity of Teaching by a Restricted Number of Examples. COLT 2009
- [c67]Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara: A Series of Run-Rich Strings. LATA 2009: 578-587
- [c66]Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213
- 2008
- [c65]Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Akira Ishino, Ayumi Shinohara: Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. RoboCup 2008: 109-120
- [c64]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto: Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375
- [c63]Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara: New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145
- [c62]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Average Value of Sum of Exponents of Runs in Strings. Stringology 2008: 185-192
- [i2]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara: New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 (2008)
- 2007
- [c61]Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara: Reducing Trials by Thinning-Out in Skill Discovery. Discovery Science 2007: 127-138
- 2006
- [c60]Hayato Kobayashi, Akira Ishino, Ayumi Shinohara: A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. IAS 2006: 660-667
- [c59]Jun Inoue, Akira Ishino, Ayumi Shinohara: Ball tracking with velocity based on Monte-Carlo localization. IAS 2006: 686-693
- [c58]Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara: Autonomous Learning of Ball Trapping in the Four-Legged Robot League. RoboCup 2006: 86-97
- 2005
- [j17]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146(2): 156-179 (2005)
- [j16]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A fully compressed pattern matching algorithm for simple collage systems. Int. J. Found. Comput. Sci. 16(6): 1155-1166 (2005)
- [j15]Zdenek Tronícek, Ayumi Shinohara: The size of subsequence automaton. Theor. Comput. Sci. 341(1-3): 379-384 (2005)
- [c57]Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Fully Incremental LCS Computation. FCT 2005: 563-574
- [c56]Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM 2005: 380-384
- [c55]Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: New Bit-Parallel Indel-Distance Algorithm. WEA 2005: 380-390
- 2004
- [j14]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano: Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinformatics and Computational Biology 2(2): 273-288 (2004)
- [j13]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004)
- [j12]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 159-170 (2004)
- [j11]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004)
- [c54]Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda: On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300
- [c53]
- [c52]Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science 2004: 32-46
- [c51]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. Developments in Language Theory 2004: 225-236
- [c50]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113
- [c49]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462
- 2003
- [j10]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa: A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003)
- [j9]Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 1(298): 253-272 (2003)
- [j8]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003)
- [j7]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003)
- [c48]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493
- [c47]Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda: On the Length of the Minimum Solution of Word Equations in One Variable. MFCS 2003: 189-197
- [c46]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217
- [c45]Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152
- [c44]
- [c43]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130
- 2002
- [c42]Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa: The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167
- [c41]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97
- [c40]Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317
- [c39]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa: Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352
- [c38]Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa: Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. SPIRE 2002: 170-186
- [c37]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324
- [c36]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa: A Note on Randomized Algorithm for String Matching with Mismatches. Stringology 2002: 9-17
- [e2]Setsuo Arikawa, Ayumi Shinohara (Eds.): Progress in Discovery Science, Final Report of the Japanese Discovery Science Project. Lecture Notes in Computer Science 2281, Springer 2002, ISBN 3-540-43338-4
- 2001
- [c35]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-Line Construction of Compact Directed Acyclic Word Graphs. CPM 2001: 169-180
- [c34]Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206
- [c33]Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468
- [c32]Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469-
- [c31]Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri: Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. Discovery Science 2001: 416-428
- [c30]Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440
- [c29]Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara: Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730
- [c28]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110
- [c27]T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo: Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122
- [c26]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Construction of the CDAWG for a Trie. Stringology 2001: 37-48
- [e1]Klaus P. Jantke, Ayumi Shinohara (Eds.): Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings. Lecture Notes in Computer Science 2226, Springer 2001, ISBN 3-540-42956-5
- 2000
- [j6]Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara: Polynomial-time Learning of Elementary Formal Systems. New Generation Comput. 18(3): 217-242 (2000)
- [c25]Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa: Speeding Up Pattern Matching by Text Compression. CIAC 2000: 306-315
- [c24]Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194
- [c23]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154
- [c22]Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138
- [c21]Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152
- [c20]Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228
1990 – 1999
- 1999
- [c19]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13
- [c18]Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49
- [c17]Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki: Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Discovery Science 1999: 359-361
- [c16]Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96
- 1998
- [j5]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)
- [c15]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa: Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112
- [c14]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform Characterizations of Polynomial-Query Learnabilities. Discovery Science 1998: 84-92
- 1997
- [j4]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997)
- [c13]Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. CPM 1997: 1-11
- [c12]Satoshi Matsumoto, Ayumi Shinohara: Learning Pattern Languages Using Queries. EuroCOLT 1997: 185-197
- 1996
- [c11]Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara: On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123
- 1995
- [j3]Ayumi Shinohara: Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. Theor. Comput. Sci. 137(1): 129-144 (1995)
- [c10]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214
- [c9]Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara: BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-366
- [c8]Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara: Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. Machine Intelligence 15 1995: 227-247
- [i1]Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions. Electronic Colloquium on Computational Complexity (ECCC) 2(22) (1995)
- 1994
- [c7]Satoshi Matsumoto, Ayumi Shinohara: Refutably Probably Approximately Correct Learning. AII/ALT 1994: 469-483
- [c6]
- [c5]Satoru Miyano, Ayumi Shinohara: Machine Learning and Discovery for Bloinformatics: Introduction. HICSS (5) 1994: 111-112
- 1993
- [j2]Setsuo Arikawa, Satoru Miyano, Ayumi Shinohara, Satoru Kuhara, Yasuhito Mukouchi, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. New Generation Comput. 11(3): 361-375 (1993)
- [c4]
- 1992
- [c3]Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. FGCS 1992: 618-625
- 1991
- [j1]Ayumi Shinohara: Teachability in Computational Learning. New Generation Comput. 8(4): 337-347 (1991)
- [c2]Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara: More About Learning Elementary Formal Systems. Nonmonotonic and Inductive Logic 1991: 107-117
- 1990
- [c1]
Coauthor Index
[i3] [j21] [j17] [j16] [c57] [j14] [j13] [j12] [j11] [c54] [c52] [c51] [c50] [c49] [j10] [j9] [j8] [j7] [c48] [c47] [c46] [c45] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c16] [c15] [c14] [c13]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-01 22:17 CEST by the dblp team