| 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 | 2020-12-04 10:40 |
Online | Online | Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.)  COMP2020-20 |
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] | COMP2020-20 pp.16-23 |
| COMP | 2019-12-13 10:50 |
Gunma | Ikaho Seminar House, Gunma University | An exact string matching algorithm based on the distances of q-gram occurrences Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.) COMP2019-33 |
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the exact string matching problem is a task to find all ... [more] | COMP2019-33 pp.31-38 |
| COMP | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University | Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10 |
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] | COMP2019-10 pp.1-5 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| COMP, IPSJ-AL | 2016-06-24 15:45 |
Ishikawa | Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8 |
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] | COMP2016-8 pp.33-40 |
|
| IN, NV (Joint) |
2012-07-19 17:10 |
Hokkaido | Hokkaido Univ. | [Invited Talk]
Analyzing power distribution networks by frontier-based method Takeru Inoue (JST), Keiji Takano (Tokyo IT), Takayuki Watanabe (Waseda Univ.), Jun Kawahara (JST), Ryo Yoshinaka (Kyoto Univ.), Akihiro Kishimoto (Tokyo IT), Koji Tsuda (AIST), Shin-ichi Minato (Hokkaido Univ.), Yasuhiro Hayashi (Waseda Univ.) IN2012-39 |
[more] | IN2012-39 pp.37-42 |
| IN, NV (Joint) |
2011-07-21 17:10 |
Hokkaido | Hokkaido University | Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka, Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ.) IN2011-55 |
Recently, novel algorithms that enumerate all possible paths on a graph have been proposed. They commonly take advantage... [more] | IN2011-55 pp.57-62 |
[Return to Top Page]