IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2020-12-04
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
COMP 2019-12-13
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
COMP 2019-09-02
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
COMP 2019-09-02
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]
COMP, IPSJ-AL 2016-06-24
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
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
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
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan