| 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 # | |
| IT, EMM | 2024-05-30 15:35 |
Chiba | Chiba University (Nishi-Chiba Campus) | On the Complexity of Codewords on Fixed-to-Fixed Length Source Coding Mitsuharu Arimura, Mitsugu Iwamoto (UEC) |
(To be available after the conference date) [more] | |
| COMP, IPSJ-AL | 2024-05-08 14:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Physical Bucket Sort on Two Kind of Items Hitomi Kozaki, Atsuki Nagao (Ochanomizu Univ.) |
(To be available after the conference date) [more] | |
| COMP, IPSJ-AL | 2024-05-09 10:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Depth-Three Circuits for Inner Product and Majority Functions Kazuyuki Amano (Gunma Univ.) |
(To be available after the conference date) [more] | |
| RCS | 2024-04-26 09:30 |
Hiroshima | (Primary: On-site, Secondary: Online) |
Performance Comparison of Null-Space Expansion in Low Computation Block Diagonalization-based Multi-User Massive MIMO Yuki Sasaki (Tokyo Univ, of Science), Kabuto Arai (The Univ. of Electro-Communications), Kazuki Maruta (Tokyo Univ, of Science) |
(To be available after the conference date) [more] | |
| COMP | 2024-03-14 11:00 |
Tokyo | The University of Electro-Communications | Proof of NP-completeness of Tasukuea Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka)  COMP2023-29 |
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] | COMP2023-29 pp.6-13 |
| 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 |
| 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 |
| RCC, ISEC, IT, WBS | 2024-03-13 16:10 |
Osaka | Osaka Univ. (Suita Campus) | A consideration on the generation of algebraic surfaces that can evaluate the computational complexity of section-finding problem Kosuke Sakata (UTokyo), Koichiro Akiyama (Toshiba) IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80 |
We report that a method for generating algebraic surfaces, theoretically evaluable for the computational complexity of t... [more] | IT2023-98 ISEC2023-97 WBS2023-86 RCC2023-80 pp.150-157 |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Reducing Quantum Communication Complexity of Linear Regression Sayaki Matsushita (Nagoya) |
Quantum coordinator model is a model that has a referee and multiple parties that can only communicate with the referee.... [more] | |
| 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:55 |
Aichi | Nagoya Univ. Venture Business Lab. | On Space Complexity of Generating a Tent Code Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) COMP2023-15 |
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it po... [more] | COMP2023-15 pp.21-23 |
| SeMI, RCS, RCC, NS, SR (Joint) |
2023-07-13 13:25 |
Osaka | Osaka University Nakanoshima Center + Online (Primary: On-site, Secondary: Online) |
Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals under Frequency-Selective Fading Channel Jun Saito, Kenichi Higuchi (Tokyo Univ. of Science) RCS2023-92 |
In this paper, we propose a parallel peak cancellation (PC) method in the peak-to-average power ratio (PAPR) reduction u... [more] | RCS2023-92 pp.64-69 |
| SRW | 2023-06-12 14:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
[Invited Lecture]
Low Complexity Multi-Targets Super-Resolution Azimuth-Ranging of FMCW Radar Kento Ogawa (Keio Univ. (Current: JSOL)), Osamu Tokumasu, Jin Mitsugi (Keio Univ.) SRW2023-7 |
This paper proposes a low-complexity multi-targets super-resolution AZ-EL ranging of FMCW radar. The complexity reductio... [more] | SRW2023-7 pp.33-38 |
| QIT (2nd) |
2023-05-29 10:10 |
Kyoto | Katsura Campus, Kyoto University | A computational complexity assumption necessary for pseudorandom quantum states generators Yuki Shirakawa (Kyoto Univ.) |
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] | |
| COMP, IPSJ-AL | 2023-05-11 10:00 |
Hokkaido | Hokkaido University | A computational complexity assumption necessary for pseudorandom quantum states generators Yuki Shirakawa (Kyoto Univ.) COMP2023-2 |
Pseudorandom quantum states generators (PRSGs) are efficient quantum algorithms that output quantum states which are com... [more] | COMP2023-2 pp.2-7 |
| RCC, ISEC, IT, WBS | 2023-03-15 10:20 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
Efficient composition of encoding polynomial in distributed coded computing scheme Daisuke Hibino, Tomoharu Shibuya (Sophia Univ.) IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116 |
Distributed computing is one of the powerful solutions for computational tasks that need the massive size of dataset. La... [more] | IT2022-119 ISEC2022-98 WBS2022-116 RCC2022-116 pp.325-330 |
| SIS | 2023-03-03 10:50 |
Chiba | Chiba Institute of Technology (Primary: On-site, Secondary: Online) |
SIS2022-51 |
The sound environment is protected by noise level regulations based on the law, and the number of noise complaints conti... [more] | SIS2022-51 pp.58-63 |
| RCS, SR, SRW (Joint) |
2023-03-01 13:25 |
Tokyo | Tokyo Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
Interference Coordination in A Cellular Distributed MU-MIMO System
-- Intra-cell Interference Coordination -- Ryo Takahashi, Hidenori Matsuo, Fumiyuki Adachi (Tohoku Univ.) RCS2022-256 |
Cellular distributed multiuser MIMO (MU-MIMO) is a cellular system in which a wide communication service area is divided... [more] | RCS2022-256 pp.54-59 |
| HIP, ITE-HI, VRPSY [detail] | 2023-02-22 15:35 |
Toyama | (Primary: On-site, Secondary: Online) |
The relationship between the beauty of fractals and processing fluency
-- Evidence from same-different response time and masking tasks -- Hayato Goto, Yousuke Kawachi (Tohoku Univ.) HIP2022-83 |
Recent studies have focused on self-similarity (fractal property) in images and processing fluency of images as possible... [more] | HIP2022-83 pp.37-42 |
| NC, NLP | 2023-01-29 10:15 |
Hokkaido | Future University Hakodate (Primary: On-site, Secondary: Online) |
Low complexity of neural activity caused by weak inhibition in spiking neural networks Jihoon Park (NICT/Osaka Univ.), Yuji Kawai (Osaka Univ.), Minoru Asada (IPUT Univ./Osaka Univ./Chubu Univ./NICT) NLP2022-96 NC2022-80 |
The balance between excitatory and inhibitory neuronal activities (E/I) is an essential factor to perform normal functio... [more] | NLP2022-96 NC2022-80 pp.81-86 |
[Return to Top Page]