|
Search the dblp DataBase
Ayumi Shinohara:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Satoshi Matsumoto, Ayumi Shinohara
Refutably Probably Approximately Correct Learning. [Citation Graph (0, 0)][DBLP] AII/ALT, 1994, pp:469-483 [Conf]
- Ayumi Shinohara
String Pattern Discovery. [Citation Graph (0, 0)][DBLP] ALT, 2004, pp:1-13 [Conf]
- Ayumi Shinohara
Complexity of Computing Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP] ALT, 1993, pp:279-287 [Conf]
- Ayumi Shinohara, Satoru Miyano
Teachability in Computational Learning. [Citation Graph (0, 0)][DBLP] ALT, 1990, pp:247-255 [Conf]
- 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]
- 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]
- 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]
- Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
Pattern-Matching for Strings with Short Descriptions. [Citation Graph (0, 0)][DBLP] CPM, 1995, pp:205-214 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Ayumi Shinohara
Complexity of Computing Generalized VC-Dimensions. [Citation Graph (0, 0)][DBLP] ECML, 1994, pp:415-418 [Conf]
- Satoshi Matsumoto, Ayumi Shinohara
Learning Pattern Languages Using Queries. [Citation Graph (0, 0)][DBLP] EuroCOLT, 1997, pp:185-197 [Conf]
- Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
Fully Incremental LCS Computation. [Citation Graph (0, 0)][DBLP] FCT, 2005, pp:563-574 [Conf]
- 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]
- Satoru Miyano, Ayumi Shinohara
Machine Learning and Discovery for Bloinformatics: Introduction. [Citation Graph (0, 0)][DBLP] HICSS (5), 1994, pp:111-112 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Zdenek Tronícek, Ayumi Shinohara
The Size of Subsequence Automaton. [Citation Graph (0, 0)][DBLP] SPIRE, 2003, pp:304-310 [Conf]
- 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]
- 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]
- 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]
- Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
New Bit-Parallel Indel-Distance Algorithm. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:380-390 [Conf]
- Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
Ternary Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP] CIAA, 2003, pp:120-130 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Ayumi Shinohara
Teachability in Computational Learning. [Citation Graph (0, 0)][DBLP] New Generation Comput., 1991, v:8, n:4, pp:337-0 [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Improvement of the performance using received message on learning of communication codes. [Citation Graph (, )][DBLP]
Multi-target adaptive A. [Citation Graph (, )][DBLP]
Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. [Citation Graph (, )][DBLP]
Computing Longest Common Substring and All Palindromes from Compressed Strings. [Citation Graph (, )][DBLP]
Bit-parallel Algorithms for Computing all the Runs in a String. [Citation Graph (, )][DBLP]
New Lower Bounds for the Maximum Number of Runs in a String. [Citation Graph (, )][DBLP]
Average Value of Sum of Exponents of Runs in Strings. [Citation Graph (, )][DBLP]
A Series of Run-Rich Strings. [Citation Graph (, )][DBLP]
New Lower Bounds for the Maximum Number of Runs in a String [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.646secs
|