Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2019-10-25 15:45 |
Hokkaido |
Sapporo Campus, Hokkaido University |
Minimal Unique Substrings in a Sliding Window Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2019-26 |
A substring $u$ of a string $T$ is called a minimal unique substring (MUS) of $T$ if $u$ occurs exactly once in $T$ and ... [more] |
COMP2019-26 pp.57-62 |
COMP |
2014-12-05 13:00 |
Kumamoto |
Sojo University |
[Invited Talk]
A new characterization of maximal repetitions by Lyndon trees Hideo Bannai (Kyushu Univ.), Tomohiro I (TU Dortmund), Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta (Kyushu Univ.) COMP2014-35 |
A run is a maximal periodic sub-interval of a string, that is at least as long as twice its smallest period. Runs are im... [more] |
COMP2014-35 p.21 |
COMP |
2011-05-11 13:00 |
Nagano |
Shinshu Univ. |
A String Pattern Matching Algorithm for Non-Linear Collage Systems Junichi Yamamoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-12 |
A non-linear text is a directed graph where each vertex is labeled with a string.
In this paper, we propose a \emph{non... [more] |
COMP2011-12 pp.1-7 |
COMP |
2011-05-11 13:35 |
Nagano |
Shinshu Univ. |
Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-13 |
A non-linear text is a directed graph where each vertex is labeled with a string.
In this paper, we define Longest comm... [more] |
COMP2011-13 pp.9-16 |
IBISML |
2010-11-04 15:00 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
Learning Evaluation Functions for Shogi Using SVM-based Bipartite Ranking Learning Daiki Suehiro, Kohei Hatano, Hideo Bannai, Eiji Takimoto, Masayuki Takeda (Kyushu Univ.) IBISML2010-74 |
Recently, automatic optimization of parameters by applying machine learning methods has become a mainstream approach for... [more] |
IBISML2010-74 pp.113-118 |
COMP |
2010-09-29 13:30 |
Niigata |
Nagaoka Univ. of Tech. |
Counting and Verifying Maximal Palindromes Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2010-27 |
A palindrome is a symmetric string that reads the same forward and backward. Let $\pals(w)$ denote the set of maximal pa... [more] |
COMP2010-27 pp.25-30 |
COMP |
2008-06-16 11:00 |
Ishikawa |
JAIST |
A Context Tree Weighting Algorithm with an Adaptive Window Tomohiro I, Kohei Hatano, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2008-17 |
The Context Tree Weighting Method (CTW) is one of the most effective algorithm in the area of universal data compression... [more] |
COMP2008-17 pp.15-22 |
COMP |
2008-06-16 11:35 |
Ishikawa |
JAIST |
Efficient XPath Tree Pattern Matching Algorithm over XML Data Stream Kazuhito Hagio, Takashi Ohgami, Masayuki Takeda (Kyushu Univ.) COMP2008-18 |
XPath is a language for specifying the selection of element nodes within XML documents.
The essential part of XPath is ... [more] |
COMP2008-18 pp.23-30 |
DE |
2007-07-02 15:45 |
Miyagi |
Akiu hot springs (Sendai) |
Fast and Lightweight Filtering of Streaming XML Documents Using Incrementally Constructed Path-trie Kazuhito Hagio, Shuichi Mitarai (Kyushu Univ.), Akira Ishino (Tohoku Univ.), Masayuki Takeda (Kyushu Univ.) DE2007-33 |
In this paper, we present a streaming XML document filter named DXAXEN which is based on incremental construction of pat... [more] |
DE2007-33 pp.67-72 |
AI |
2007-05-31 13:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
String data compression, pattern matching, and pattern discovery Masayuki Takeda (Kyushu Univ.) AI2007-5 |
The compressed pattern matching (CPM, in short) problem is, given a compressed string data, to perform a string pattern ... [more] |
AI2007-5 p.25 |
COMP |
2007-04-26 16:25 |
Kyoto |
Katsura Campus, Kyoto University |
Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They
used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |