Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP, IPSJAL 
20210508 11:00 
Online 
Online 
An Extension of Cartesian Tree Matching Basedon Subsequences Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.) COMP20216 
In this paper, we consider the Cartesian tree matching problem, originally introduced by Park et al. in 2019. Despite of... [more] 
COMP20216 pp.3945 
COMP 
20191025 10:00 
Hokkaido 
Sapporo Campus, Hokkaido University 
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN) COMP201918 
[more] 
COMP201918 pp.110 
COMP 
20191025 10:25 
Hokkaido 
Sapporo Campus, Hokkaido University 
Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number Kazuhiro Kurita (Hokkaido Univ.), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (Hokkaido Univ.) COMP201919 
(To be available after the conference date) [more] 
COMP201919 pp.1118 
NC, IBISML, IPSJBIO, IPSJMPS [detail] 
20180613 16:15 
Okinawa 
Okinawa Institute of Science and Technology 
Enumeration of Distinct Support Vectors for Model Selection Kentaro Kanamori (Hokaido Univ.), Satoshi Hara (Osaka Univ.), Masakazu Ishihata (NTT), Hiroki Arimura (Hokaido Univ.) IBISML201812 
In ordinary machine learning problems, the learning algorithm outputs a single model that optimizes its learning objecti... [more] 
IBISML201812 pp.8188 
ISEC, COMP 
20171222 14:40 
Kochi 
Eikokuji Campus, Kochi University of Technology 
Efficient Enumeration of Dominating Sets in KDegenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC201789 COMP201743 
A dominating set is one of the fundamental graph structure, like clique, independent set, st path, and cut. It is known... [more] 
ISEC201789 COMP201743 pp.111117 
CNR 
20150629 14:15 
Tokyo 

Toward automatic composition of shortshort stories by computers Hitoshi Matsubara (FUN), Satoshi Sato (Nagoya Univ.), Hideyuki Nakashima (FUN), Mina Akaishi (Hosei Univ.), Kaoru Sumi, Hiroko Otsuka (FUN), Hajime Murai (TIT), Keiji Hirata, Kazushi Mukaiyama (FUN), Koichi Hori (Tokyo univ.), Hiroki Arimura (Hokkaido Univ.) CNR20151 
This paper describes our project on automatic composition of Shin’ichi Hoshilike short short stories. The project is ... [more] 
CNR20151 pp.14 
COMP, IPSJAL 
20150613 14:20 
Hokkaido 

On an Extension of Ukkonen's Online Suffix tree construction algorithm to MultiStream texts Takuya Takagi, Hiroki Arimura (Hokkaido Univ.) COMP201513 
In this paper, we consider online construction of a text index for a set $S$ of $K$ strings in the dynamic setting that
... [more] 
COMP201513 pp.125132 
COMP, IPSJAL 
20150613 14:45 
Hokkaido 

Efficient Approximate Pattern Matching Algorithm for Trajectory Data Hirohito Sasakawa, Hiroki Arimura (Hokkaido Univ.) COMP201514 
[more] 
COMP201514 pp.133139 
COMP 
20130318 13:45 
Gifu 
Gifu University 
Compact and Fast Indices Based on ZeroSuppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shinichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP201256 
In many reallife problems, we are often faced with manipulating families of sets. Manipulation of largescale set famil... [more] 
COMP201256 pp.2330 
COMP 
20120621 09:55 
Hokkaido 
Hokkaido University 
Rich Operations for Manipulating Sequence Binary Decision Diagrams Shuhei Denzumi, Hiroki Arimura, Shinichi Minato (Hokkaido Univ.) COMP201213 
Manipulating large sequence data is important problem in string processing field. In this paper, we deal with sequence b... [more] 
COMP201213 pp.916 
IBISML 
20120312 10:00 
Tokyo 
The Institute of Statistical Mathematics 
Chance Adjusted Infinite Relational Model for Asymmetric and Individually Different Relational Data Analysis Iku Ohama, Hiromi Iida (Panasonic), Takuya Kida, Hiroki Arimura (Hokkaido Univ.) IBISML201187 
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed ... [more] 
IBISML201187 pp.18 
IBISML 
20110328 10:20 
Osaka 
Nakanoshima Center, Osaka Univ. 
Event Clustering Method based on Linear HMM for Geotagged Personal Contents Iku Ohama (Panasonic), Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Toshihisa Abe (Panasonic) IBISML2010105 
We discuss the geographical clustering problem on human activity logs. In this Paper, we formulate the problem as a segm... [more] 
IBISML2010105 pp.916 
COMP, IPSJAL 
20100519 14:30 
Ishikawa 
Japan Advanced Institute of Science and Technology 
Efficient Pattern Matching for Acyclic Regular Expressions Yusaku Kaneta, Shinichi Minato, Hiroki Arimura (Hokkaido Univ.) COMP201011 
A regular expression is \name{acyclic} if it is over the basis in $\Sigma$, dot ``$\cdot$'', and union ``$$''. In this ... [more] 
COMP201011 pp.2329 
IPSJSLDM, VLD, CPSY, RECONF [detail] 
20100126 11:15 
Kanagawa 
Keio Univ (Hiyoshi Campus) 
Development of Interdisciplinary Research Environment by Collaboration of eLearning and Remote FPGA Jaeseong Kim, Shingo Yoshizawa, Yusaku Kaneta, Shinichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD200974 CPSY200956 RECONF200959 
Field programmable gate array (FPGA) can reconfigure logic circuits after production, which is embedded into electric in... [more] 
VLD200974 CPSY200956 RECONF200959 pp.3134 
IPSJSLDM, VLD, CPSY, RECONF [detail] 
20100127 12:40 
Kanagawa 
Keio Univ (Hiyoshi Campus) 
An efficient hardwareoriented algorithm for regular expression matching based on parallel bitdistribution Yusaku Kaneta, Shingo Yoshizawa, Shinichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD200990 CPSY200972 RECONF200975 
In this paper, we study the regular expression matching problem for fast data stream processing. We present an efficient... [more] 
VLD200990 CPSY200972 RECONF200975 pp.131136 
DE 
20080921 17:00 
Fukushima 

[Poster Presentation]
Efficient Spam Post Detection by Compressionbased Measure Using Suffix Trees Takashi Uemura (Hokaido Univ.), Daisuke Ikeda (Kyushu Univ.), Hiroki Arimura (Hokaido Univ.) DE200837 
In this paper, we propose a contentbased spam detection algorithm for
blog spams and bulletin board spams.
For a give... [more] 
DE200837 pp.1516 
COMP 
20080418 14:55 
Osaka 
Osaka Prefecture University 
Learning Walks from Graphs Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.) COMP20086 
In this paper, we study the problem of learning an unknown label sequence, called a walk, that is embedded in a collecti... [more] 
COMP20086 pp.3540 
COMP 
20070426 17:00 
Kyoto 
Katsura Campus, Kyoto University 
On an Efficient OffLine Construction of Property Suffix Trees Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) COMP200710 
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target... [more] 
COMP200710 pp.7178 
COMP 
20050915 14:35 
Osaka 
Osaka Univ., Toyonaka Campus 
A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) 
In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs... [more] 
COMP200532 pp.3138 
COMP 
20041014 16:45 
Miyagi 
Tohoku University 
An Effcient Mining Algorithm for Frequent Closed Sequential Episodes Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) 
In this paper, we consider the enumeration problem for
the class of frequent closed sequence patterns, called frequent... [more] 
COMP200445 pp.1522 