| 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-05-08 14:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Physical Bucket Sort on Two Kind of Items Hitomi Kozaki, Atsuki Nagao (Ochanomizu Univ.)  COMP2024-2 |
(To be available after the conference date) [more] | COMP2024-2 pp.2-6 |
| 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.) COMP2024-4 |
(To be available after the conference date) [more] | COMP2024-4 p.9 |
| 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] | |
| SP, NLC, IPSJ-SLP, IPSJ-NL [detail] | 2023-12-02 13:30 |
Tokyo | Kikai-Shinko-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
Effectiveness of Signal Compression in Speech Enhancement with Diffusion Models Yuki Nishi (Titech), Koji Iwano (Tokyo City Univ.), Koichi Shinoda (Titech) NLC2023-14 SP2023-34 |
(To be available after the conference date) [more] | NLC2023-14 SP2023-34 pp.1-6 |
| 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 |
| 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 | 2022-12-06 11:00 |
Ehime | Ehime Univ. Media Hall | Average space complexity of tent expansions around the golden ratio Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) COMP2022-24 |
(To be available after the conference date) [more] | COMP2022-24 pp.18-20 |
| COMP | 2022-12-06 15:25 |
Ehime | Ehime Univ. Media Hall | COMP2022-29 |
(To be available after the conference date) [more] | COMP2022-29 pp.40-47 |
| IT, ISEC, RCC, WBS | 2022-03-11 15:35 |
Online | Online | Improvement of Evaluation Function for Unable Combine Portion in Transformation Protocol Ryunosuke Takita, Koichi Koizumi, Masanobu Ohtsuki (Fukushima KOSEN) IT2021-129 ISEC2021-94 WBS2021-97 RCC2021-104 |
In the conventional Transformation Protocol, the evaluation of the Unable Combine Portion, which is a set of cards conta... [more] | IT2021-129 ISEC2021-94 WBS2021-97 RCC2021-104 pp.270-274 |
| COMP | 2021-12-03 | Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Polynomial-time Extraction of the Maximum Clique Using Eigenvalue Relation Yasunori Ohto |
We prove that the maximum clique problem can be solved in polynomial time. First, we prove the relationship between the ... [more] | |
| AP, RCS (Joint) |
2021-11-10 14:55 |
Nagasaki | NBC-Bekkan (Nagasaki) (Primary: On-site, Secondary: Online) |
Computational Complexity Reduction of High Accuracy Fingerprint Method by using Last Received Data on Time Series and correcting Receiving Performance deference Takahiro Tsujino, Teruya Fujii (Tokyo Tech) RCS2021-151 |
As a location detection method without using GPS, there is a fingerprint method. It measures the received radio wave pow... [more] | RCS2021-151 pp.40-45 |
| QIT (2nd) |
2021-05-24 12:10 |
Online | Online | Tighter lower bounds of the error probability of multiple quantum channel discrimination Ryo Ito, Ryuhei Mori (Tokyo Tech) |
We give lower bounds of the error probability of general multiple quantum channel discrimination problem for a given num... [more] | |
| RCS, SR, SRW (Joint) |
2021-03-05 16:55 |
Online | Online | [Invited Lecture]
Intelligent radio-wave design that controls the propagation path itself Riku Ohmiya, Masashi Iwabuchi, Tomoki Murakami, Tomoaki Ogawa, Yasushi Takatori (NTT) SRW2020-82 |
(To be available after the conference date) [more] | SRW2020-82 pp.104-109 |
| SIS, ITE-BCT | 2020-10-01 10:10 |
Online | Online | A Study on Computational Cost Reduction of Quantitative Evaluation Method of Contrast Improvement for Dichromats Xi Cheng, Go Tanaka (Nagoya City Univ.) SIS2020-10 |
People with color vision deficiency feel difficult in discriminating specific color combinations. In recent years, many ... [more] | SIS2020-10 pp.1-4 |
| SR, NS, SeMI, RCC, RCS (Joint) |
2020-07-08 13:25 |
Online | Online | Optimization of repeater combinations using integer programming Riku Ohmiya, Tomoki Murakami, Masashi Iwabuchi, Masaaki Nishino, Tomoaki Ogawa, Yasushi Takatori (NTT) RCS2020-63 |
In recent years, a new type repeater called IRS (Intelligent Reflecting Surface) that can reconfigure the propagation pa... [more] | RCS2020-63 pp.31-36 |
| SP, EA, SIP | 2020-03-02 10:35 |
Okinawa | Okinawa Industry Support Center (Cancelled but technical report was issued) |
Dimension reduction without multiplication in machine learning Nobutaka Ono (TMU) EA2019-104 SIP2019-106 SP2019-53 |
In this study, we propose a dimension reduction method for machine learning by only selecting elements without multiplic... [more] | EA2019-104 SIP2019-106 SP2019-53 pp.21-26 |
| COMP | 2019-12-13 14:35 |
Gunma | Ikaho Seminar House, Gunma University | On a formula for Boolean expressions of Conjunctive normal form and computational complexity Tomoya Machide (NII) COMP2019-37 |
An Boolean expression in conjunctive normal form, abbreviated as CNF, is used as a canonical normal form in Boolean logi... [more] | COMP2019-37 pp.55-59 |
| AP | 2019-08-22 10:25 |
Hokkaido | Hokkai-Gakuen Univ. | Block Diagonalization using Pseudo Inverse Matrix for MU-MIMO Keiya Uchida, Mitoshi Fujimoto (Univ. Fukui), Koshiro Kitao, Tetsuro Imai (NTT DOCOMO) AP2019-54 |
The 5th Generation(5G) will introduce MU-MIMO to achieve super high bit rate. Also, Massive MIMO will be effective to co... [more] | AP2019-54 pp.39-42 |
| COMP | 2019-03-18 13:45 |
Tokyo | The University of Tokyo | [Invited Talk]
Non-Black-Box Worst-Case to Average-Case Reductions within NP Shuichi Hirahara (Univ. Tokyo) COMP2018-49 |
There are significant obstacles to establishing an equivalence between the worst-case and average-case hardness of NP: S... [more] | COMP2018-49 p.43 |
[Return to Top Page]