The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ayumi Shinohara: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda
    On Bit-Parallel Processing of Multi-byte Text. [Citation Graph (0, 0)][DBLP]
    AIRS, 2004, pp:289-300 [Conf]
  2. Satoshi Matsumoto, Ayumi Shinohara
    Refutably Probably Approximately Correct Learning. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:469-483 [Conf]
  3. Ayumi Shinohara
    String Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:1-13 [Conf]
  4. Ayumi Shinohara
    Complexity of Computing Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    ALT, 1993, pp:279-287 [Conf]
  5. Ayumi Shinohara, Satoru Miyano
    Teachability in Computational Learning. [Citation Graph (0, 0)][DBLP]
    ALT, 1990, pp:247-255 [Conf]
  6. Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
    Speeding Up Pattern Matching by Text Compression. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:306-315 [Conf]
  7. Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Multiple Pattern Matching Algorithms on Collage System. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:193-206 [Conf]
  8. Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Shift-And Approach to Pattern Matching in LZW Compressed Text. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:1-13 [Conf]
  9. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Pattern-Matching for Strings with Short Descriptions. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:205-214 [Conf]
  10. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
    On-Line Construction of Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:169-180 [Conf]
  11. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
    The Minimum DAWG for All Suffixes of a String and Its Applications. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:153-167 [Conf]
  12. Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda
    An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:1-11 [Conf]
  13. Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    A Boyer-Moore Type Algorithm for Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:181-194 [Conf]
  14. Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Pattern Matching in Text Compressed by Using Antidictionaries. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:37-49 [Conf]
  15. Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa
    Multiple Pattern Matching in LZW Compressed Text. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:103-112 [Conf]
  16. Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Compressed Pattern Matching for SEQUITUR. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:469-0 [Conf]
  17. Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Faster Approximate String Matching over Compressed Text. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:459-468 [Conf]
  18. Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
    Uniform Characterizations of Polynomial-Query Learnabilities. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:84-92 [Conf]
  19. Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    A Practical Algorithm to Find the Best Subsequence Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2000, pp:141-154 [Conf]
  20. Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    A Practical Algorithm to Find the Best Episode Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2001, pp:435-440 [Conf]
  21. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Discovering Best Variable-Length-Don't-Care Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2002, pp:86-97 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:32-46 [Conf]
  23. Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri
    Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2001, pp:416-428 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:359-361 [Conf]
  25. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
    Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:486-493 [Conf]
  26. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:225-236 [Conf]
  27. Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
    Finding Best Patterns Practically. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:307-317 [Conf]
  28. Ayumi Shinohara
    Complexity of Computing Generalized VC-Dimensions. [Citation Graph (0, 0)][DBLP]
    ECML, 1994, pp:415-418 [Conf]
  29. Satoshi Matsumoto, Ayumi Shinohara
    Learning Pattern Languages Using Queries. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:185-197 [Conf]
  30. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Fully Incremental LCS Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:563-574 [Conf]
  31. 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. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:618-625 [Conf]
  32. Satoru Miyano, Ayumi Shinohara
    Machine Learning and Discovery for Bloinformatics: Introduction. [Citation Graph (0, 0)][DBLP]
    HICSS (5), 1994, pp:111-112 [Conf]
  33. Hayato Kobayashi, Akira Ishino, Ayumi Shinohara
    A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. [Citation Graph (0, 0)][DBLP]
    IAS, 2006, pp:660-667 [Conf]
  34. Jun Inoue, Akira Ishino, Ayumi Shinohara
    Ball tracking with velocity based on Monte-Carlo localization. [Citation Graph (0, 0)][DBLP]
    IAS, 2006, pp:686-693 [Conf]
  35. Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
    Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:719-730 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    ISMB, 1995, pp:359-358 [Conf]
  37. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Inferring Strings from Graphs and Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:208-217 [Conf]
  38. Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
    On the Length of the Minimum Solution of Word Equations in One Variable. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:189-197 [Conf]
  39. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
    Space-Economical Construction of Index Structures for All Suffixes of a String. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:341-352 [Conf]
  40. Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara
    Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. [Citation Graph (0, 0)][DBLP]
    Machine Intelligence 15, 1995, pp:227-247 [Conf]
  41. Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara
    More About Learning Elementary Formal Systems. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1991, pp:107-117 [Conf]
  42. Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
    Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:380-384 [Conf]
  43. Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:132-138 [Conf]
  44. Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Online Construction of Subsequence Automata for Multiple Texts. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:146-152 [Conf]
  45. Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
    Linear-Time Off-Line Text Compression by Longest-First Substitution. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:137-152 [Conf]
  46. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2001, pp:96-110 [Conf]
  47. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Compact Directed Acyclic Word Graphs for a Sliding Window. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:310-324 [Conf]
  48. T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo
    Musical Sequence Comparison for Melodic and Rhythmic Similarities. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2001, pp:111-122 [Conf]
  49. Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    A Unifying Framework for Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE/CRIWG, 1999, pp:89-96 [Conf]
  50. Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Bit-Parallel Approach to Approximate String Matching in Compressed Texts. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:221-228 [Conf]
  51. 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. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:170-186 [Conf]
  52. Zdenek Tronícek, Ayumi Shinohara
    The Size of Subsequence Automaton. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:304-310 [Conf]
  53. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:98-113 [Conf]
  54. Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
    On the Hardness of Approximating the Minimum Consistent OBDD Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:112-123 [Conf]
  55. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    Finding Optimal Pairs of Patterns. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:450-462 [Conf]
  56. Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
    New Bit-Parallel Indel-Distance Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:380-390 [Conf]
  57. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
    Ternary Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:120-130 [Conf]
  58. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
    On-line construction of compact directed acyclic word graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:2, pp:156-179 [Journal]
  59. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    A fully compressed pattern matching algorithm for simple collage systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1155-1166 [Journal]
  60. Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara
    On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:165-170 [Journal]
  61. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
    Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:273-288 [Journal]
  62. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Compact directed acyclic word graphs for a sliding window. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:1, pp:33-51 [Journal]
  63. 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. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1993, v:11, n:3, pp:361-375 [Journal]
  64. Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara
    Polynomial-time Learning of Elementary Formal Systems. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2000, v:18, n:3, pp:217-242 [Journal]
  65. Ayumi Shinohara
    Teachability in Computational Learning. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1991, v:8, n:4, pp:337-0 [Journal]
  66. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
    A Note on Randomized Algorithm for String Matching with Mismatches. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:2-12 [Journal]
  67. Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1997, v:4, n:2, pp:172-186 [Journal]
  68. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:4, pp:159-170 [Journal]
  69. Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
    Uniform characterizations of polynomial-query learnabilities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:2, pp:377-385 [Journal]
  70. Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    A practical algorithm to find the best subsequence patterns. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:2, pp:465-479 [Journal]
  71. Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Collage system: a unifying framework for compressed pattern matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:298, pp:253-272 [Journal]
  72. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
    Ternary directed acyclic word graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:97-111 [Journal]
  73. Ayumi Shinohara
    Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:1, pp:129-144 [Journal]
  74. Zdenek Tronícek, Ayumi Shinohara
    The size of subsequence automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:379-384 [Journal]
  75. Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara
    Reducing Trials by Thinning-Out in Skill Discovery. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:127-138 [Conf]
  76. Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara
    Autonomous Learning of Ball Trapping in the Four-Legged Robot League. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2006, pp:86-97 [Conf]

  77. Improvement of the performance using received message on learning of communication codes. [Citation Graph (, )][DBLP]


  78. Multi-target adaptive A. [Citation Graph (, )][DBLP]


  79. Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. [Citation Graph (, )][DBLP]


  80. Computing Longest Common Substring and All Palindromes from Compressed Strings. [Citation Graph (, )][DBLP]


  81. Bit-parallel Algorithms for Computing all the Runs in a String. [Citation Graph (, )][DBLP]


  82. New Lower Bounds for the Maximum Number of Runs in a String. [Citation Graph (, )][DBLP]


  83. Average Value of Sum of Exponents of Runs in Strings. [Citation Graph (, )][DBLP]


  84. A Series of Run-Rich Strings. [Citation Graph (, )][DBLP]


  85. New Lower Bounds for the Maximum Number of Runs in a String [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.157secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002