| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2022-12-06 11:25 |
Ehime | Ehime Univ. Media Hall | 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 | 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 | 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 | 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 | 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 | 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 | 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 | 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 | 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 | Efficient Approximate Pattern Matching Algorithm for Trajectory Data Hirohito Sasakawa, Hiroki Arimura (Hokkaido Univ.) COMP2015-14 |
[more] | COMP2015-14 pp.133-139 |
|
| COMP | 2013-03-18 13:45 |
Gifu | Gifu University | Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] | COMP2012-56 pp.23-30 |
| COMP | 2012-06-21 09:55 |
Hokkaido | Hokkaido University | Rich Operations for Manipulating Sequence Binary Decision Diagrams Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato (Hokkaido Univ.) COMP2012-13 |
Manipulating large sequence data is important problem in string processing field. In this paper, we deal with sequence b... [more] | COMP2012-13 pp.9-16 |
| IBISML | 2012-03-12 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.) IBISML2011-87 |
We propose a new generative model which analyses asymmetric and individually different relational data. In our proposed ... [more] | IBISML2011-87 pp.1-8 |
| IBISML | 2011-03-28 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) IBISML2010-105 |
We discuss the geographical clustering problem on human activity logs. In this Paper, we formulate the problem as a segm... [more] | IBISML2010-105 pp.9-16 |
| COMP, IPSJ-AL | 2010-05-19 14:30 |
Ishikawa | Japan Advanced Institute of Science and Technology | Efficient Pattern Matching for Acyclic Regular Expressions Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.) COMP2010-11 |
A regular expression is \name{acyclic} if it is over the basis in $\Sigma$, dot ``$\cdot$'', and union ``$|$''. In this ... [more] | COMP2010-11 pp.23-29 |
| IPSJ-SLDM, VLD, CPSY, RECONF [detail] | 2010-01-26 11:15 |
Kanagawa | Keio Univ (Hiyoshi Campus) | Development of Interdisciplinary Research Environment by Collaboration of e-Learning and Remote FPGA Jaeseong Kim, Shingo Yoshizawa, Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD2009-74 CPSY2009-56 RECONF2009-59 |
Field programmable gate array (FPGA) can reconfigure logic circuits after production, which is embedded into electric in... [more] | VLD2009-74 CPSY2009-56 RECONF2009-59 pp.31-34 |
| IPSJ-SLDM, VLD, CPSY, RECONF [detail] | 2010-01-27 12:40 |
Kanagawa | Keio Univ (Hiyoshi Campus) | An efficient hardware-oriented algorithm for regular expression matching based on parallel bit-distribution Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD2009-90 CPSY2009-72 RECONF2009-75 |
In this paper, we study the regular expression matching problem for fast data stream processing. We present an efficient... [more] | VLD2009-90 CPSY2009-72 RECONF2009-75 pp.131-136 |
| DE | 2008-09-21 17:00 |
Fukushima | [Poster Presentation]
Efficient Spam Post Detection by Compression-based Measure Using Suffix Trees Takashi Uemura (Hokaido Univ.), Daisuke Ikeda (Kyushu Univ.), Hiroki Arimura (Hokaido Univ.) DE2008-37 |
In this paper, we propose a content-based spam detection algorithm for blog spams and bulletin board spams. For a give... [more] |
DE2008-37 pp.15-16 |
|
| COMP | 2008-04-18 14:55 |
Osaka | Osaka Prefecture University | Learning Walks from Graphs Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.) COMP2008-6 |
In this paper, we study the problem of learning an unknown label sequence, called a walk, that is embedded in a collecti... [more] | COMP2008-6 pp.35-40 |
| COMP | 2007-04-26 17:00 |
Kyoto | Katsura Campus, Kyoto University | On an Efficient Off-Line Construction of Property Suffix Trees Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) COMP2007-10 |
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target... [more] | COMP2007-10 pp.71-78 |
[Return to Top Page]