| 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 # | |
| CQ, CBE (Joint) |
2025-01-30 09:40 |
Fukuoka | (Fukuoka, Online) (Primary: On-site, Secondary: Online) |
An Empirical Study on the Applicability of GNN to Graph Reduction Tomoya Matoba, Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) |
(To be available after the conference date) [more] | |
| CQ, CBE (Joint) |
2025-01-30 15:10 |
Fukuoka | (Fukuoka, Online) (Primary: On-site, Secondary: Online) |
Study on the Important Eigenvalues and Eigenvectors Based on Low-Rank Approximation with Graph Spectrum Shift Koki Kampu, Mikihiro Yasuda, Yusuke Sakumoto (Kwansei Gakuin Univ.) |
(To be available after the conference date) [more] | |
| IA | 2025-01-23 14:05 |
Tokyo | NICT Innovation Center (Tokyo, Online) (Primary: On-site, Secondary: Online) |
Preliminary Study on Constructing a Method for Estimating Important Eigenvalues of Graph Matrices Using Degree-Biased Random Walk Ryosuke Ozaki, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) |
(To be available after the conference date) [more] | |
| RISING (3rd) |
2024-11-12 09:15 |
Hokkaido | Kaderu 2・7 (Sapporo) (Hokkaido) | [Poster Presentation]
Routing method to maximize bottleneck link bandwidth using particle swarm optimization Yuki Norimatsu, Takuya Asaka (Tokyo Metropolitan Univ.) |
With the advancement of networking technologies, data transmission capabilities continue to increase. To efficiently tra... [more] | |
| CQ (2nd) |
2024-08-28 16:20 |
Fukushima | Tenjin-Misaki Sports Park (Fukushima) | [Poster Presentation]
Study on the Characteristics of the Graph Spectrum Shift for Low-Rank Approximation Koki Kampu, Yusuke Sakumoto (Kwansei Gakuin Univ.) |
The matrices (e.g., adjacency matrix and Laplacian matrix) representing graph structures are utilized in various graph a... [more] | |
| EMM, BioX, ISEC, SITE, ICSS, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2024-07-22 13:50 |
Hokkaido | Sapporo Convention Center (Hokkaido) | A generalization of quantum ISD algorithm for Syndrome Decoding Problem Asuka Wakasugi (EAGLYS), Mitsuru Tada (Chiba Univ.)  ISEC2024-10 SITE2024-7 BioX2024-20 HWS2024-10 ICSS2024-14 EMM2024-16 |
The Information Set Decoding (ISD) algorithm is the best-known decoding algorithm for the syndrome decoding problem, whi... [more] | ISEC2024-10 SITE2024-7 BioX2024-20 HWS2024-10 ICSS2024-14 EMM2024-16 pp.16-22 |
| CCS | 2024-03-27 16:50 |
Hokkaido | RUSUTSU RESORT (Hokkaido) | JPEG Compression Quality Setting Considering Image Quality and Information Loss for Correlated Steganography Mariiko Aikawa, Sumiko Miyata (SIT), Kaito Hosono, Hirotsugu Kinoshita (KU) CCS2023-50 |
As more and more confidential information, including personal information, is transmitted and received over the Internet... [more] | CCS2023-50 pp.64-69 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) (Osaka) | Reconstruction of Boyer quantum algorithm and its application to hash puzzles Chris Idota, Yuichi Kaji (Nagoya Univ.) IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 |
This study investigates the computational complexity of solving hash puzzles using quantum algorithms. A hash puzzle is ... [more] | IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 pp.358-365 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) (Osaka) | A generalization of ISD algorithm for Syndrome Decoding Problem Asuka Wakasugi (EAGLYS), Tada Mitsuru (Chiba Univ.) IT2023-106 ISEC2023-105 WBS2023-94 RCC2023-88 |
The Information Set Decoding (ISD) algorithm is the best-known decoding algorithm for the syndrome decoding problem, whi... [more] | IT2023-106 ISEC2023-105 WBS2023-94 RCC2023-88 pp.205-211 |
| NLP, MSS | 2024-03-14 11:15 |
Misc. | Kikai-Shinko-Kaikan Bldg. (Misc.) | Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] | MSS2023-89 NLP2023-141 pp.87-92 |
| IE, MVE, CQ, IMQ (Joint) [detail] |
2024-03-13 14:30 |
Okinawa | Okinawa Sangyo Shien Center (Okinawa, Online) (Primary: On-site, Secondary: Online) |
Study on Evaluating the Effectiveness of Graph Summarization for Sampling Graphs Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) CQ2023-75 |
In recent years, a compact graph representation called {em summary graph} has been extensively studied. This representa... [more] | CQ2023-75 pp.26-31 |
| IE, MVE, CQ, IMQ (Joint) [detail] |
2024-03-15 09:50 |
Okinawa | Okinawa Sangyo Shien Center (Okinawa, Online) (Primary: On-site, Secondary: Online) |
IMQ2023-68 IE2023-123 MVE2023-97 |
We propose a simultaneous method of multimodal graph signal denoising and graph learning. Since sensor networks distribu... [more] | IMQ2023-68 IE2023-123 MVE2023-97 pp.301-306 |
| AI | 2024-03-01 13:40 |
Aichi | Room0221, Bldg.2-C, Nagoya Institute of Technology (Aichi) | Applying Graph Neural Networks and Reinforcement Learning to the Multiple Depot-Multiple Traveling Salesman Problem Dongyeop Kim, Toshihiro Matsui (NITech) AI2023-39 |
In this study, we introduce a method combining Graph Neural Networks (GNN) and reinforcement learning for the Multiple D... [more] | AI2023-39 pp.13-18 |
| NS, IN (Joint) |
2024-03-01 10:10 |
Okinawa | Okinawa Convention Center (Okinawa) | A Performance Evaluation of Graph Cutting Methods that Maintain the Shortest Paths in Internet Topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT) IN2023-90 |
The Internet is operated in units of autonomous systems (AS). By interconnecting multiple ASes, the ASes maintain commu... [more] |
IN2023-90 pp.148-153 |
| VLD, HWS, ICD | 2024-03-01 15:30 |
Okinawa | (Okinawa, Online) (Primary: On-site, Secondary: Online) |
A Pipelined NTT Transformer and its Extension Scheme Designed for the Digital Signature Scheme Crystals-Dilithium Pengfei Sun, Makoto Ikeda (Tokyo Univ.) VLD2023-130 HWS2023-90 ICD2023-119 |
As quantum computing advances, it threatens the security of current encryption algorithms, making Post-Quantum Cryptogra... [more] | VLD2023-130 HWS2023-90 ICD2023-119 pp.161-166 |
| VLD, HWS, ICD | 2024-03-01 16:20 |
Okinawa | (Okinawa, Online) (Primary: On-site, Secondary: Online) |
An Efficient Hardware Approach for High-Speed SPHINCS+ Signature Generation Yuta Takeshima, Makoto Ikeda (The Univ. of Tokyo) VLD2023-132 HWS2023-92 ICD2023-121 |
This study addresses the challenges traditional cryptographic systems face with the advent of quantum computers by focus... [more] | VLD2023-132 HWS2023-92 ICD2023-121 pp.173-177 |
| ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2024-02-19 13:30 |
Hokkaido | Hokkaido Univ. (Hokkaido) | Characteristic analysis to improve the performance of graph-based methods in approximate nearest neighbor search Tomohiro Kanaumi, Yusuke Matsui (Univ. Tokyo) ITS2023-52 IE2023-41 |
Approximate nearest neighbor search (ANNS) is the problem of finding the nearest vector to a given query vector in a dat... [more] | ITS2023-52 IE2023-41 pp.34-39 |
| ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2024-02-20 12:45 |
Hokkaido | Hokkaido Univ. (Hokkaido) | 3D CG Coded Image Noise Removal and Quality Assessment Based on Optimal Design of Total Variation Regularization Norifumi Kawabata (Kanazawa Gakuin Univ.) ITS2023-67 IE2023-56 |
Sparse coding techniques, which reproduce and represent images with as few combinations as possible from a small amount ... [more] | ITS2023-67 IE2023-56 pp.112-117 |
| COMP | 2023-12-22 10:00 |
Miyazaki | Miyazaki Univ. Machinaka Campus (Miyazaki) | Approximation Algorithms for Generalizations of Strong Connectivity Augmentation Problem Ryoma Norose, Yutaro Yamaguchi (Osaka Univ.) COMP2023-16 |
A directed graph G is said to be strongly connected if there exists a directed path between any pair of vertices in G. S... [more] | COMP2023-16 pp.1-5 |
| COMP | 2023-12-22 10:25 |
Miyazaki | Miyazaki Univ. Machinaka Campus (Miyazaki) | Algorithms for Optimally Shifting Intervals under Intersection Graph Models Honorato Droguett Nicolas, Kazuhiro Kurita (Nagoya Univ.), Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-17 |
We address a general optimisation problem of minimising the moving distance applied to the objects of an intersection gr... [more] | COMP2023-17 pp.6-11 |
[Return to Top Page]