Search the dblp DataBase
Masayuki Takeda :
[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 ] Tadanobu Furukawa , Tomofumi Matsuzawa , Yutaka Matsuo , Koki Uchiyama , Masayuki Takeda Behavioral Analysis Based on Relations in Weblogs. [Citation Graph (0, 0)][DBLP ] ASWC, 2006, pp:162-168 [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 ] 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 On-Line Linear-Time Construction of Word Suffix Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:60-71 [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 ] Masayuki Takeda String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:147-151 [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 ] Ryosuke Nakamura , Hideo Bannai , Shunsuke Inenaga , Masayuki Takeda Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. [Citation Graph (0, 0)][DBLP ] DCC, 2007, pp:123-132 [Conf ] Hideo Bannai , Kohei Hatano , Shunsuke Inenaga , Masayuki Takeda Practical Algorithms for Pattern Based Linear Regression. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2005, pp:44-56 [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 ] Yasuto Higa , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda A New Family of String Classifiers Based on Local Relatedness. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2006, pp:114-124 [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 ] Mayumi Yamasaki , Masayuki Takeda , Tomoko Fukuda , Ichiro Nanri Discovering Characteristic Patterns from Collections of Classical Japanese Poems. [Citation Graph (0, 0)][DBLP ] Discovery Science, 1998, pp:129-140 [Conf ] Tomohiko Sugimachi , Akira Ishino , Masayuki Takeda , Fumihiro Matsuo A Method of Extracting Related Words Using Standardized Mutual Information. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2003, pp:478-485 [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 ] Masayuki Takeda , Tetsuya Matsumoto , Tomoko Fukuda , Ichiro Nanri Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2000, pp:112-126 [Conf ] Kouichi Tamari , Mayumi Yamasaki , Takuya Kida , Masayuki Takeda , Tomoko Fukuda , Ichiro Nanri Discovering Poetic Allusion in Anthologies of Classical Japanese Poems. [Citation Graph (0, 0)][DBLP ] Discovery Science, 1999, pp:128-138 [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 ] Masayuki Takeda , Tomoko Fukuda , Ichiro Nanri Mining from Literary Texts: Pattern Discovery and Similarity Computation. [Citation Graph (0, 0)][DBLP ] Progress in Discovery Science, 2002, pp:518-531 [Conf ] Yusuke Ishida , Shunsuke Inenaga , Ayumi Shinohara , Masayuki Takeda Fully Incremental LCS Computation. [Citation Graph (0, 0)][DBLP ] FCT, 2005, pp:563-574 [Conf ] Naoki Mori , Masayuki Takeda , Keinosuke Matsumoto A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices. [Citation Graph (0, 0)][DBLP ] GECCO, 2005, pp:1485-1492 [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 ] Tetsuro Kitahara , Katsuhisa Ishida , Masayuki Takeda ism: Improvisation Supporting Systems with Melody Correction and Key Vibration. [Citation Graph (0, 0)][DBLP ] ICEC, 2005, pp:315-327 [Conf ] Tadanobu Furukawa , Tomofumi Matsuzawa , Yutaka Matsuo , Koki Uchiyama , Masayuki Takeda Analysis of User's Relation and Reading Activity in Weblogs. [Citation Graph (0, 0)][DBLP ] JSAI Workshops, 2005, pp:280-290 [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 ] Katsuhisa Ishida , Tetsuro Kitahara , Masayuki Takeda ism: Improvisation Supporting System based on Melody Correction. [Citation Graph (0, 0)][DBLP ] NIME, 2004, pp:177-180 [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 ] Shunsuke Inenaga , Masayuki Takeda Sparse Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP ] SPIRE, 2006, pp:61-73 [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 ] Hisashi Tsuji , Akira Ishino , Masayuki Takeda A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. [Citation Graph (0, 0)][DBLP ] SPIRE, 2005, pp:388-398 [Conf ] Yasuto Higa , Hideo Bannai , Shunsuke Inenaga , Masayuki Takeda Reachability on suffix tree graphs. [Citation Graph (0, 0)][DBLP ] Stringology, 2006, pp:212-225 [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 ] Shunsuke Inenaga , Masayuki Takeda Sparse compact directed acyclic word graphs. [Citation Graph (0, 0)][DBLP ] Stringology, 2006, pp:197-211 [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 ] 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 ] Noriyoshi Uratani , Masayuki Takeda A Fast String-Searching Algorithm for Multiple Patterns. [Citation Graph (0, 0)][DBLP ] Inf. Process. Manage., 1993, v:29, n:6, pp:775-792 [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 ] Mayumi Yamasaki , Masayuki Takeda , Tomoko Fukuda , Ichiro Nanri Discovery Characteristic Patterns from Collections of Classical Japanese Poems. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 2000, v:18, n:1, pp:61-74 [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 ] 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 ] Masayuki Takeda , Tomoko Fukuda , Ichiro Nanri , Mayumi Yamasaki , Kouichi Tamari Discovering instances of poetic allusion from anthologies of classical Japanese poems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:292, n:2, pp:497-524 [Journal ] Masayuki Takeda , Tetsuya Matsumoto , Tomoko Fukuda , Ichiro Nanri Discovering characteristic expressions in literary works. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:292, n:2, pp:525-546 [Journal ] Kazuyuki Narisawa , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda Efficient Computation of Substring Equivalence Classes with Suffix Arrays. [Citation Graph (0, 0)][DBLP ] CPM, 2007, pp:340-351 [Conf ] Kazuyuki Narisawa , Hideo Bannai , Kohei Hatano , Masayuki Takeda Unsupervised Spam Detection Based on String Alienness Measures. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2007, pp:161-172 [Conf ] Smooth Boosting for Margin-Based Ranking. [Citation Graph (, )][DBLP ] Online Learning of Maximum p-Norm Margin Classifiers with Bias. [Citation Graph (, )][DBLP ] Verifying a Parameterized Border Array in O (n 1.5 ) Time. [Citation Graph (, )][DBLP ] Chimera: Stream-Oriented XML Filtering/Querying Engine. [Citation Graph (, )][DBLP ] String Kernels Based on Variable-Length-Don't-Care Patterns. [Citation Graph (, )][DBLP ] Context-Sensitive Grammar Transform: Compression and Pattern Matching. [Citation Graph (, )][DBLP ] Parameterized Suffix Arrays for Binary Strings. [Citation Graph (, )][DBLP ] A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. [Citation Graph (, )][DBLP ] Counting Parameterized Border Arrays for a Binary Alphabet. [Citation Graph (, )][DBLP ] Lightweight Parameterized Suffix Array Construction. [Citation Graph (, )][DBLP ] Search in 0.054secs, Finished in 0.058secs