| 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 | 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 | 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 |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Practical algorithm for optimal Clifford+T approximation of SU(2) Hayata Morisaki (Osaka Univ.) |
In this paper, we consider the problem of approximating arbitrary single-qubit unitaries with a given precision $epsilon... [more] | |
| CQ | 2023-07-12 14:00 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Study on the Effectiveness of Matrix Approximation without Rank Constraint Eriko Segawa, Yusuke Sakumto (Kwansei Gakuin Univ.) CQ2023-10 |
The proper selection of graph spectrum is crucial for constructing efficient graph algorithms. We have discussed a matri... [more] | CQ2023-10 pp.12-17 |
| QIT (2nd) |
2023-05-29 13:20 |
Kyoto | Katsura Campus, Kyoto University | Probabilistic state synthesis based on optimal convex approximation Seiseki Akibue (NTT), Go Kato (NICT), Seiichiro Tani (NTT) |
When preparing a pure state with a quantum circuit, there is an inevitable coherent error since each unitary gate suffer... [more] | |
| COMP, IPSJ-AL | 2023-05-10 14:30 |
Hokkaido | Hokkaido University | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 11:25 |
Okinawa | Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
Study on the Importance of Each Eigenvalue and Eigenvector for Laplacian Matrix Using Matrix Approximation Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-84 |
It is important for developing sophisticated graph algorithms to understand deeply the characteristics of the typical ma... [more] | CQ2022-84 pp.25-30 |
| RCC, ISEC, IT, WBS | 2023-03-14 13:25 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
A Greedy Algorithm for the Minimum-Entropy Coupling Problem Taisei Shibata, Ken-ichi Iwata, Kengo Hashimoto (Univ. Fukui) IT2022-101 ISEC2022-80 WBS2022-98 RCC2022-98 |
The Minimum-Entropy coupling problem is the problem of finding a joint distribution that achieves the minimum entropy fo... [more] | IT2022-101 ISEC2022-80 WBS2022-98 RCC2022-98 pp.212-217 |
| COMP | 2023-03-02 11:30 |
Tokyo | Ochanomizu University | A trial on estimating the volume of n-dimensional polytope using the multivariate Laplace transformation Ei Ando (Senshu Univ.), Christian Engels (NII) COMP2022-34 |
It is often hard to compute the volume of an $n$-dimensional polytope. We consider the volume of the intersection of mul... [more] | COMP2022-34 pp.7-14 |
| IN, IA (Joint) |
2022-12-13 10:15 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Investigation of a Matrix Approximation Method for Analyzing the Information Amount Contained in the Specified Eigenvalues and Eigenvectors Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ) IA2022-56 |
In general, the large eigenvalues and their eigenvectors of a matrix representing the network structure are important to... [more] | IA2022-56 pp.47-49 |
| NC, MBE (Joint) |
2022-09-30 10:30 |
Miyagi | Tohoku Univ. (Primary: On-site, Secondary: Online) |
An approximation algorithm for computing integrated information based on Gaussian process regression Tadaaki Hosaka (TUS) NC2022-40 |
The framework of Integrated Information Theory, which aims to mathematically deal with consciousness, consists of multip... [more] | NC2022-40 pp.32-37 |
| NLP, MICT, MBE, NC (Joint) [detail] |
2022-01-21 16:00 |
Online | Online | On the Study of Second-Order Training Algorithm using Matrix Diagonalization based on Hutchinson estimation Ryo Yamatomi, Shahrzad Mahboubi, Hiroshi Ninomiya (Shonan Inst. Tec.) NLP2021-89 MICT2021-64 MBE2021-50 |
In this study, we propose a new training algorithm based on the second-order approximated gradient method, which aims to... [more] | NLP2021-89 MICT2021-64 MBE2021-50 pp.67-70 |
| IBISML | 2022-01-17 11:00 |
Online | Online | Cluster approximation in quantum Boltzmann machine based on information geometry Masaya Hoshikawa, Tomohiro Ogawa (UEC) IBISML2021-21 |
A Boltzmann Machine (BM) is a model of machine learning which consists of mutually connected probabilistic binary units... [more] |
IBISML2021-21 pp.23-28 |
| SDM, ICD, ITE-IST [detail] | 2021-08-17 11:45 |
Online | Online | Approximation of Non-Linear Function for Hardware Implementation of Echo-State-Network Amartuvshin Bayasgalan, Makoto Ikeda (UTokyo) SDM2021-32 ICD2021-3 |
Reservoir computing (RC) is a machine-learning algorithm that can learn complex temporal signals while presenting a fast... [more] | SDM2021-32 ICD2021-3 pp.12-17 |
| COMP | 2021-03-08 15:45 |
Online | Online | A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| WBS, IT, ISEC | 2021-03-05 14:20 |
Online | Online | Improvement of Cicalese-Gargano-Vaccaro Algorithm for the Minimum-Entropy Couplings Problem Kohei Sakatani, Ken-ichi Iwata (Univ. of Fukui), Hiroshi Fujisaki (Kanazawa Univ.) IT2020-151 ISEC2020-81 WBS2020-70 |
Minimum-Entropy coupling is a problem of finding a joint probability distribution of minimum entropy from the set of joi... [more] | IT2020-151 ISEC2020-81 WBS2020-70 pp.239-244 |
| ITS, WBS, RCC | 2020-12-14 10:45 |
Online | Online | A Study on Relaxation of Network Restriction in Deep-Unfolding aided Consensus Shoya Ogawa, Ishii Koji (Kagawa Univ.) WBS2020-11 ITS2020-7 RCC2020-14 |
In the consensus problem with a complex network, the convergence performance deeply depends on the given parameters, i.e... [more] | WBS2020-11 ITS2020-7 RCC2020-14 pp.19-24 |
| AP, SANE, SAT (Joint) |
2020-07-16 11:10 |
Online | Online | [Invited Lecture]
Accelerating ray tracing using nonuniform ray launching directions Takahiro Hashimoto, Michio Takikawa (Mitsubishi electric) AP2020-15 |
Ray-tracing has been successfully used as a site specific radio propagation model adopted to wide range applications suc... [more] | AP2020-15 pp.33-38 |
| MSS, CAS, SIP, VLD | 2020-06-18 10:25 |
Online | Online | On numerical approximated solutions of an ordinary differential\ equation using a LSTM neural network Kazuya Ozawa, Kaito Isogai, Hideaki Okazaki (SIT) CAS2020-2 VLD2020-2 SIP2020-18 MSS2020-2 |
Recurrent neural networks (RNNs) were demonstrated to provide good accuracy when modeling nonlinear circuits. However, s... [more] | CAS2020-2 VLD2020-2 SIP2020-18 MSS2020-2 pp.7-9 |
| COMP | 2020-03-01 14:25 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
On Approximation Algorithms for Power Vertex Cover Problem Takumi Tatematsu, Tetsuro Rintani, Toshihiro Fujito (TUT) COMP2019-50 |
We present two 2-approximation algorithms for Power Vertex Cover problem, which is a generalization of the Vertex Cover... [more] |
COMP2019-50 pp.29-33 |
[Return to Top Page]