Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IBISML |
2024-12-20 17:20 |
Hokkaido |
Lecture room 1 (D101), Graduate School of Environmental Science (Hokkaido, Online) (Primary: On-site, Secondary: Online) |
Revising Rulelists via Integer Linear Programming Yoichi Sasaki, Yuzuru Okajima (NEC), Hiroki Arimura (Hokkaido University) IBISML2024-45 |
(To be available after the conference date) [more] |
IBISML2024-45 pp.94-99 |
COMP |
2023-12-22 14:45 |
Miyazaki |
Miyazaki Univ. Machinaka Campus (Miyazaki) |
[Short Paper]
Finding Diverse Longest Common Subsequences of a Set of Strings Yuto Shida, Hiroki Arimura, Yasuaki Kobayashi (Hokkaido Univ.) COMP2023-23 |
(To be available after the conference date) [more] |
COMP2023-23 pp.45-52 |
COMP |
2022-12-06 11:25 |
Ehime |
Ehime Univ. Media Hall (Ehime) |
Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) COMP2022-25 |
(To be available after the conference date) [more] |
COMP2022-25 pp.21-28 |
COMP |
2022-12-06 15:25 |
Ehime |
Ehime Univ. Media Hall (Ehime) |
COMP2022-29 |
(To be available after the conference date) [more] |
COMP2022-29 pp.40-47 |
COMP, IPSJ-AL |
2021-05-08 11:00 |
Online |
Online (Online) |
An Extension of Cartesian Tree Matching Based-on Subsequences Takeshi Kai, Kenta Mitsuyoshi, Isamu Furuya, Hiroki Arimura (Hokkaido Univ.) COMP2021-6 |
In this paper, we consider the Cartesian tree matching problem, originally introduced by Park et al. in 2019. Despite of... [more] |
COMP2021-6 pp.39-45 |
COMP |
2019-10-25 10:00 |
Hokkaido |
Sapporo Campus, Hokkaido University (Hokkaido) |
Efficient Pattern Matching for Large Regular Expressions Based on Sequence Binary Decision Diagrams Ryosuke Takizawa, Takuya Kida, Hiroki Arimura (Hokkaido Univ.), Ichigaku Takigawa (RIKEN) COMP2019-18 |
[more] |
COMP2019-18 pp.1-10 |
COMP |
2019-10-25 10:25 |
Hokkaido |
Sapporo Campus, Hokkaido University (Hokkaido) |
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.) COMP2019-19 |
(To be available after the conference date) [more] |
COMP2019-19 pp.11-18 |
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] |
2018-06-13 16:15 |
Okinawa |
Okinawa Institute of Science and Technology (Okinawa) |
Enumeration of Distinct Support Vectors for Model Selection Kentaro Kanamori (Hokaido Univ.), Satoshi Hara (Osaka Univ.), Masakazu Ishihata (NTT), Hiroki Arimura (Hokaido Univ.) IBISML2018-12 |
In ordinary machine learning problems, the learning algorithm outputs a single model that optimizes its learning objecti... [more] |
IBISML2018-12 pp.81-88 |
ISEC, COMP |
2017-12-22 14:40 |
Kochi |
Eikokuji Campus, Kochi University of Technology (Kochi) |
Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43 |
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] |
ISEC2017-89 COMP2017-43 pp.111-117 |
CNR |
2015-06-29 14:15 |
Tokyo |
(Tokyo) |
Toward automatic composition of short-short 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.) CNR2015-1 |
This paper describes our project on automatic composition of Shin’ichi Hoshi-like short short stories. The project is ... [more] |
CNR2015-1 pp.1-4 |
COMP, IPSJ-AL |
2015-06-13 14:20 |
Hokkaido |
(Hokkaido) |
On an Extension of Ukkonen's Online Suffix tree construction algorithm to Multi-Stream texts Takuya Takagi, Hiroki Arimura (Hokkaido Univ.) COMP2015-13 |
In this paper, we consider online construction of a text index for a set $S$ of $K$ strings in the dynamic setting that
... [more] |
COMP2015-13 pp.125-132 |
COMP, IPSJ-AL |
2015-06-13 14:45 |
Hokkaido |
(Hokkaido) |
Efficient Approximate Pattern Matching Algorithm for Trajectory Data Hirohito Sasakawa, Hiroki Arimura (Hokkaido Univ.) COMP2015-14 |
[more] |
COMP2015-14 pp.133-139 |