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 - 20 of 71  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
ISEC 2023-05-17
Tokyo Kikai-Shinko-Kaikan Bldg. BDD enumeration for Module-LWE using lattice rotation structure
Togo Sakurai, Atsushi Takayasu (The Univ. of Tokyo) ISEC2023-10
Module-LWE is the analog of LWE that includes algebraic structures. In July 2022, two cryptographic schemes based on Mod... [more] ISEC2023-10
COMP, IPSJ-AL 2023-05-11
Hokkaido Hokkaido University Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph
Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2023-5
Given a graph $G = (V, E)$ with a terminal set $W subseteq V$,
a vertex subset $S subseteq V$ is an emph{induced Stein... [more]
COMP 2022-12-06
Ehime Ehime Univ. Media Hall Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) COMP2022-21
We consider the reconfiguration and enumeration problems of optimal cyclic ladder lotteries. First, we investigate the t... [more] COMP2022-21
COMP 2022-10-26
Fukuoka Kyusyu Univ. Nishijin Plaza Enumeration of Transversal Edge-Partitions
Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.) COMP2022-16
In this paper, we consider the problem of enumerating transversal edge-partition of an irreducible triangulation. We pro... [more] COMP2022-16
COMP 2022-10-26
Fukuoka Kyusyu Univ. Nishijin Plaza Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17
In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] COMP2022-17
COMP, IPSJ-AL 2022-09-15
Kanagawa Keio Univ.
(Primary: On-site, Secondary: Online)
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs
Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2022-11
Given a graph ???? = (????, ????) with a terminal set ???? ⊆ ????, a vertex subset ???? ⊆ ???? is an induced Steiner sub... [more] COMP2022-11
COMP 2022-03-06
Online Online Enumerating Labeled Graphs Under Given Constraints Using Answer Set Programming
Yu Nakahata (NAIST) COMP2021-36
Enumeration of constrained graphs is important for both graph-theoretical study and testcase generation. We propose a me... [more] COMP2021-36
COMP, IPSJ-AL 2021-05-08
Online Online [Invited Talk] Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project
Shin-ichi Minato (Kyoto Univ.) COMP2021-8
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] COMP2021-8
MI 2021-03-15
Online Online Surgical planning model generation by extracting important feature sets in mandibular reconstruction
Kazuki Nagai, Megumi Nakao (Kyoto Univ.), Nobuhiro Ueda (Nara Medical Univ.), Yuichiro Imai (Rakuwakai Otowa Hospital), Toshihide Hatanaka, Tadaaki Kirita (Nara Medical Univ.), Tetsuya Matsuda (Kyoto Univ.) MI2020-54
Because implicit medical knowledge and experience are used to perform medical treatment, such decisions must be clarifie... [more] MI2020-54
MI 2021-03-15
Online Online Analysis of important features in surgical planning for mandibular reconstruction among multiple surgeons
Yusuke Hatakeyama, Kazuki Nagai, Megumi Nakao, Tetsuya Matsuda (Kyoto Univ.) MI2020-55
Surgeons perform surgical treatment by considering the facilities and policies of medical institutions and their own exp... [more] MI2020-55
WBS, IT, ISEC 2021-03-04
Online Online A note on sufficient condition for reconstructable substring of CSE method
Shungo Tanaka, Hiroshi Kamabe, Shan Lu (Gifu Univ.) IT2020-116 ISEC2020-46 WBS2020-35
Various data compression methods have been proposed, which can be roughly classified into two cat-egories: lossless comp... [more] IT2020-116 ISEC2020-46 WBS2020-35
SIP, IT, RCS 2021-01-22
Online Online Optimal Non-binary Single Insertion Deletion Correcting Code Construction by Maximum Clique Enumeration
Akira Mitsutake, Takayuki Nozaki (Yamaguchi Univ.), Etsuji Tomita (UEC) IT2020-89 SIP2020-67 RCS2020-180
The purpose of this research is to construct non-binary single deletion correcting codes with large cardinalities.
It i... [more]
IT2020-89 SIP2020-67 RCS2020-180
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
IT 2020-12-02
Online Online Enumeration and Coding of Binary AIFV-m Code Trees
Genta Onishi, Kengo Hashimoto, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2020-33
Using the one-to-one correspondence between binary AIFV codes and Schröder paths, Sumigawa and Yamamoto gave a method to... [more] IT2020-33
COMP 2020-10-23
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Polynomial Delay Enumeration for Steiner Problems
Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) COMP2020-17
Let $G = (V, E)$ be a undirected graph and let $W subseteq V$ be a set of terminals. A emph{Steiner subgraph} of $(G, W)... [more] COMP2020-17
COMP, IPSJ-AL 2020-05-09
Online Online Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES
Etsuji Tomita (Univ. Electro-Comm.), Alessio Conte (Univ. of Pisa) COMP2020-1
We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006.
It is... [more]
MI 2020-01-29
Okinawa OKINAWAKEN SEINENKAIKAN Proposal of Extraction Method of Important Features in Surgical Planning for Mandibular Reconstruction
Kazuki Nagai, Megumi Nakao (Kyoto Univ.), Nobuhiro Ueda (Nara Medical Univ.), Yuichiro Imai (Rakuwakai Otowa Hospital), Tadaaki Kirita (Nara Medical Univ.), Tetsuya Matsuda (Kyoto Univ.) MI2019-70
As implicit medical knowledge and experience are used to perform medical treatment, clarification of decision making is ... [more] MI2019-70
NS 2019-10-10
Aichi Nagoya Institute of Technology [Invited Talk] On recent developments in network reliability computation using binary decision diagrams
Jun Kawahara (Kyoto Univ.) NS2019-113
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] NS2019-113
COMP 2019-09-02
Okayama Tsushima Campus, Okayama University On the number of complete k-ary trees of height h
Yosuke Kikuchi (NIT, Tsuyama College), Yume Ikeda (NTTEast-Minamikanto) COMP2019-15
We give the number of complete $k$-ary trees of height $h$.
It is known that the number of complete binary trees of hei... [more]
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]
 Results 1 - 20 of 71  /  [Next]  
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