| 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 # | |
| AP | 2024-06-13 14:55 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
A Consideration on Reducing the Influence of Array Errors in DOA Estimation Using Compressed Sensing Nobuyoshi Kikuma, Kokoa Nakano, Kunio Sakakibara, Yoshiki Sugimoto (NITech) |
(To be available after the conference date) [more] | |
| ITE-ME, ITE-IST, BioX, SIP, MI, IE [detail] | 2024-06-06 14:10 |
Niigata | Nigata University (Ekinan-Campus "TOKIMATE") | (To be available after the conference date) [more] | ||
| IT, EMM | 2024-05-30 12:50 |
Chiba | Chiba University (Nishi-Chiba Campus) | A Study of Proximal Decoding enhanced by Deep Unfolding Asahi Ito, Lantian Wei, Tadashi Wadayama (NIT) |
(To be available after the conference date) [more] | |
| QIT (2nd) |
2024-05-28 - 2024-05-30 |
Ibaraki | AIST Tsukuba | [Poster Presentation]
The signaling dimension of polytopic generalized probabilistic theories Shuriku Kai, Michele Dall'Arno (TUT) |
[more] | |
| EA | 2024-05-22 13:50 |
Online | Online | Determined BSS based on the proximal average of IVA and DNNs Kazuki Matsumoto (Waseda Univ.), Koki Yamada, Kohei Yatabe (TUAT) |
(To be available after the conference date) [more] | |
| SR | 2024-05-21 10:45 |
Kagoshima | Yokacenter (Kagoshima) (Primary: On-site, Secondary: Online) |
[Short Paper]
A Study on Low-Complexity Simulation Framework for Large-Scale Channel Knowledge Maps with Spatial Correlation Koya Sato, Katsuya Suto (UEC) |
(To be available after the conference date) [more] | |
| NLP | 2024-05-09 15:30 |
Kagawa | Kagawa Prefecture Social Welfare Center | An Euclidean Steiner Tree Problem Solver based on Genetic Algorithm and Delaunay Triangulation Liping Zhang, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  NLP2024-6 |
In this report, we propose an approach based on the genetic algorithm and the Delaunay triangulation for solving the Euc... [more] | NLP2024-6 pp.25-30 |
| COMP, IPSJ-AL | 2024-05-08 15:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | An Algorithm for Finding the Condorcet Winner Die Ro Sho, Hatano Kohei (Kyushu Univ.), Kijima Shuji (Shiga Univ.), Takimoto Eiji (Kyushu Univ.) COMP2024-3 |
In general, a set of dice is intransitive, e.g., Efron’s dice. This paper investigates to find the strongest die under a... [more] | COMP2024-3 pp.7-8 |
| COMP, IPSJ-AL | 2024-05-09 11:05 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.) COMP2024-5 |
Given an instance of combinatorial optimization problem $mathcal{A}$ with multiple optimal solutions, how can we efficie... [more] | COMP2024-5 pp.10-13 |
| COMP, IPSJ-AL | 2024-05-09 11:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Online Exploration of Rectilinear Polygons by Multiple Searchers Taro Abe, Yuya Higashikawa, Shuichi Miyazaki (Univ. of Hyogo) COMP2024-6 |
In this paper, we consider efficient exploration of unknown simple rectilinear polygons by multiple searchers. Searchers... [more] | COMP2024-6 pp.14-19 |
| 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 |
| AP | 2024-03-14 10:25 |
Fukui | UNIVERSITY OF FUKUI (Primary: On-site, Secondary: Online) |
Direction of arrival estimation using neural networks and Uniform Cross Array for LoS-MIMO transmission Motoshi Tawada, Yoshichika Ohta (SoftBank) AP2023-202 |
The feeder link between the fixed ground station and the HAPS requires high capacity to accommodate the traffic of termi... [more] | AP2023-202 pp.7-10 |
| COMP | 2024-03-14 11:30 |
Tokyo | The University of Electro-Communications | Masyu is Constant-Time Testable Kotaro Kabutoishi, Hiro Ito (UEC) COMP2023-30 |
In this presentation, we provide a constant-time tester, or a tester for short, for a board puzzle “Masyu.” This puzzle... [more] |
COMP2023-30 pp.14-21 |
| CAS, CS | 2024-03-14 15:10 |
Okinawa | [Special Invited Talk]
Challenges and Future Direction in Message-Passing Demodulation Keigo Takeuchi (TUT) CAS2023-121 CS2023-114 |
Message-passing demodulation is a promising method for demodulation in massive multiple-input multiple-output (MIMO) upl... [more] | CAS2023-121 CS2023-114 pp.58-63 |
|
| PN | 2024-03-15 09:20 |
Kagoshima | (Primary: On-site, Secondary: Online) |
Study on Symbol-block AES Cryptography for Digital Coherent Communication Hodaka Amano, Takahiro Kodama (Kagawa Univ.) PN2023-77 |
We applied symbol block AES encryption, which inherits the four functions that form the basic structure of the advanced ... [more] | PN2023-77 pp.42-47 |
| COMP | 2024-03-14 13:30 |
Tokyo | The University of Electro-Communications | [Invited Talk]
Gap Amplification for Reconfiguration Problems Naoto Ohsaka (CyberAgent) COMP2023-31 |
Combinatorial reconfiguration is an emerging field of theoretical computer science that studies the reachability between... [more] | COMP2023-31 p.22 |
| COMP | 2024-03-14 16:00 |
Tokyo | The University of Electro-Communications | Time Analysis of Space Efficient Uniform Partitioning in Population Protocols Pascal Sahner (NAIST/RWTH Aachen), Ryota Eguchi (NAIST), Fukuhito Ooshita (FUT), Michiko Inoue (NAIST) COMP2023-34 |
Population protocols are a theoretical model for modeling a set of units with low computational capabilities - so called... [more] | COMP2023-34 pp.34-41 |
| KBSE | 2024-03-14 16:20 |
Okinawa | Okinawa Prefectual General Welfare Center (Primary: On-site, Secondary: Online) |
Automated Stepwise Policy Design for Stepwise Discrete Controller Synthesis Takuto Yamauchi (Waseda Univ.), Kenji Tei (Tokyo Tech.), Shinichi Honiden (Waseda Univ.) KBSE2023-77 |
Discrete Controller Synthesis (DCS) automatically synthesizes a safety-guaranteed behavioral specification for a given o... [more] | KBSE2023-77 pp.73-75 |
| RCC, ISEC, IT, WBS | 2024-03-13 11:10 |
Osaka | Osaka Univ. (Suita Campus) | Revisiting the Soundness of 5-Pass Identification Scheme Daigo Kuroki, Kaoru Takemure, Bagus Santoso (UEC) IT2023-82 ISEC2023-81 WBS2023-70 RCC2023-64 |
We observe that mostly, the security of 5-pass identification schemes have only been analyzed in a emph{rough} way as f... [more] |
IT2023-82 ISEC2023-81 WBS2023-70 RCC2023-64 pp.44-51 |
| RCC, ISEC, IT, WBS | 2024-03-13 15:05 |
Osaka | Osaka Univ. (Suita Campus) | Public-Key Identification Scheme Based on a New NP-Hard Tensor Problem Akitaka Yokota, Bagus Santoso (UEC) IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 |
No general quantum algorithm is known to efficiently solve computational problems based on Multivariate Quadratic Poly... [more] |
IT2023-90 ISEC2023-89 WBS2023-78 RCC2023-72 pp.94-101 |
[Return to Top Page]