| 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, IPSJ-AL | 2024-09-05 15:30 |
Hiroshima | Hiroshima Institute of Technology (Hiroshima, Online) (Primary: On-site, Secondary: Online) |
Computing Betweenness Centrality in Time-varying Network using Zero-suppressed Binary Decision Diagram Daiki Ando, Yu Nakahata, Shoji Kasahara (NAIST)  COMP2024-10 |
Betweenness Centrality (BC) is a measure of the importance of the vertices in a network. BC has been extensively studied... [more] | COMP2024-10 pp.1-7 |
| SAT, RCS (Joint) |
2024-08-30 09:40 |
Kochi | CUL-PORT(Kochi City) (Temporary) (Kochi, Online) (Primary: On-site, Secondary: Online) |
A Study on Active User Enumeration Using Common Pilot Sequence for Grant-Free Access in the Presence of Carrier Frequency Offsets Takanori Hara (Tokyo Univ. of Science) RCS2024-126 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access has gained much attention.... [more] | RCS2024-126 pp.54-59 |
| IA | 2024-01-25 16:10 |
Tokyo | Kwansei Gakuin Univiversity, Marunouchi Campus (Tokyo, Online) (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Router Security Assessment Using CAPEC Vulnerability Assessment Criteria Yu-Chaing Wang, Tai-Ying Chiu, Bor-Yao Tseng, Bagus Tri Atmaja, Jiann-Liang Chen, Shih-Ping Chiu (NTUST), Jian-Chang Hsu (ITRI) IA2023-62 |
Our research addresses the nexus of router performance and security in contemporary cyberinfrastructure. Routers, pivota... [more] | IA2023-62 pp.30-36 |
| COMP | 2023-12-22 14:10 |
Miyazaki | Miyazaki Univ. Machinaka Campus (Miyazaki) | Efficient Enumeration of Quantum Circuits Realizing Boolean Functions by Toffoli Gate Count Shigeru Yamashita (Ritsumeikan Univ.), Takashi Horiyama (Hokkaido Univ.), Norihito Yasuda (NTT) COMP2023-22 |
Quantum Boolean circuits, which compute Boolean functions necessary for quantum computation, are commonly designed using... [more] | COMP2023-22 pp.37-44 |
| ISEC | 2023-05-17 14:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Tokyo) | 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 pp.54-61 |
| COMP, IPSJ-AL | 2023-05-11 14:20 |
Hokkaido | Hokkaido University (Hokkaido) | 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] |
COMP2023-5 pp.22-28 |
| COMP | 2022-12-06 09:30 |
Ehime | Ehime Univ. Media Hall (Ehime) | 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 pp.1-8 |
| COMP | 2022-10-26 14:00 |
Fukuoka | Kyusyu Univ. Nishijin Plaza (Fukuoka) | 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 pp.14-20 |
| COMP | 2022-10-26 14:30 |
Fukuoka | Kyusyu Univ. Nishijin Plaza (Fukuoka) | 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 pp.21-28 |
| COMP, IPSJ-AL | 2022-09-15 11:00 |
Kanagawa | Keio Univ. (Kanagawa, Online) (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 pp.3-9 |
| COMP | 2022-03-06 16:00 |
Online | 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 pp.26-30 |
| COMP, IPSJ-AL | 2021-05-08 13:30 |
Online | 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 p.54 |
| MI | 2021-03-15 13:45 |
Online | 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 pp.29-34 |
| MI | 2021-03-15 14:00 |
Online | 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 pp.35-40 |
| WBS, IT, ISEC | 2021-03-04 11:20 |
Online | 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 pp.25-30 |
| SIP, IT, RCS | 2021-01-22 10:40 |
Online | 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 pp.142-147 |
| COMP | 2020-12-04 10:40 |
Online | 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 |
| IT | 2020-12-02 10:50 |
Online | 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 pp.50-55 |
| COMP | 2020-10-23 17:05 |
Osaka | Osaka Univ. (Osaka, Online) (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 pp.39-46 |
| COMP, IPSJ-AL | 2020-05-09 15:10 |
Online | 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] |
COMP2020-1 pp.1-8 |
[Return to Top Page]