Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
CCS |
2024-03-27 16:50 |
Hokkaido |
RUSUTSU RESORT |
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) |
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) |
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. |
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 (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 (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 |
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 |
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 |
(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 |
(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. |
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. |
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 |
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 |
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 |
IN, IA (Joint) |
2023-12-22 15:00 |
Hiroshima |
Satellite Campus Hiroshima |
[Short Paper]
A Study on the Applicability of Graph Reduction to Evaluating the Robustness of Complex Networks Murakawa Yamato, Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) IA2023-53 |
Generally, the computational complexity of network simulation and machine learning based on graph structure such as GNN ... [more] |
IA2023-53 pp.48-52 |
CPSY, IPSJ-ARC, IPSJ-HPC |
2023-12-06 10:30 |
Okinawa |
Okinawa Industry Support Center (Primary: On-site, Secondary: Online) |
Development of Genetic Algorithm for Grid Graph in Order/Degree Problem Kimura Hiroto, Yoshiko Hanada (Kansai Univ.), Masahiro Nakao, Keiji Yamamoto (R-CCS) CPSY2023-32 |
We propose a genetic algorithm for solving grid graph that is a kind of Order/Degree problems (ODP). Grid graph is an op... [more] |
CPSY2023-32 pp.31-35 |
ICSS |
2023-11-16 16:00 |
Ishikawa |
IT Business Plaza Musashi and Online (Primary: On-site, Secondary: Online) |
Security Analysis of MP-LWE using Weighted Lattice Reduction Yudai Tagawa, Shinya Okumura, Atsuko Miyaji (Osaka Univ.) ICSS2023-57 |
In 2017, Roşca et al. proposed the Middle-Product LWE (MP-LWE) problem, a new LWE problem variant. The MP-LWE problem mi... [more] |
ICSS2023-57 pp.42-48 |
COMP |
2023-10-24 13:30 |
Aichi |
Nagoya Univ. Venture Business Lab. |
An algorithm for the secure total domination problem in proper interval graphs Toru Araki, Yasufumi Aita (Gunma Univ.) COMP2023-11 |
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] |
COMP2023-11 pp.1-8 |
COMP |
2023-10-24 14:05 |
Aichi |
Nagoya Univ. Venture Business Lab. |
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono, Kosuke Sugiyama (Nagoya Univ.) COMP2023-12 |
For an undirected graph $G=(V,E)$ and a $k$-nonnegative integer vector $bp=(p_1,ldots,p_k)$, a mapping $lcolon Vto mathb... [more] |
COMP2023-12 pp.9-11 |
COMP |
2023-10-24 16:20 |
Aichi |
Nagoya Univ. Venture Business Lab. |
Algorithm of uniform deployment for mobile robots in perfect bipartite graphs Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.) COMP2023-14 |
In this paper, we consider the uniform deployment problem of mobile robots in perfect bipartite graphs. Intuitively, whe... [more] |
COMP2023-14 pp.13-20 |