Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS, NS (Joint) |
2022-12-15 11:40 |
Aichi |
Nagoya Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
Evaluation of MMSE Postcoding Schemes for Reducing Inter-cluster-interference in A Cellular Distributed MU-MIMO System Ryo Takahashi, Hidenori Matsuo, Fumiyuki Adachi (Tohoku Univ.) RCS2022-189 |
Cellular distributed multi-user MIMO (MU-MIMO) is a system in which a large number of distributed antennas deployed over... [more] |
RCS2022-189 pp.25-30 |
QIT (2nd) |
2022-12-08 16:45 |
Kanagawa |
Keio Univ. (Primary: On-site, Secondary: Online) |
Improved Hardness Results for the Guided Local Hamiltonian Problem Ryu Hayakawa (Kyoto Univ.), Francois Le Gall (Nagoya Univ.), Sevag Gharibian (Paderborn University), Tomoyuki Morimae (Kyoto Univ.) |
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further... [more] |
|
QIT (2nd) |
2022-12-08 14:00 |
Kanagawa |
Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Note on Quantum Divide and Conquer for Minimal String Rotation Qisheng Wang (NU) |
Lexicographically minimal string rotation is a fundamental problem on string processing that has recently attracted a lo... [more] |
|
MIKA (3rd) |
2022-10-13 11:10 |
Niigata |
Niigata Citizens Plaza (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Performance Improvement of Massive MIMO Inter-User Interference Suppression by Iterative Replica Subtraction Takuto Suzuki, Kazuki Maruta (Tokyo Univ. of Science), Salah Berra (Lusofona Univ.), Osamu Muta (Kyushu Univ.) |
In massive MIMO, precoding has an interference cancellation issue because the channel size has a considerable dimension ... [more] |
|
SAT, RCS (Joint) |
2022-08-25 11:40 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
A Study on Computational Complexity Reduction of Pre/Postcoding in User-Cluster-Centric CF-mMIMO Ryo Takahashi, Hidenori Matsuo, Sijie Xia, Qiang Chen, Fumiyuki Adachi (Tohoku Univ.) RCS2022-101 |
Cell-Free massive MIMO (CF-mMIMO), which cooperatively utilizes a large number of antennas deployed over a wide communic... [more] |
RCS2022-101 pp.24-29 |
IT |
2022-07-21 14:55 |
Okayama |
Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] |
IT2022-19 pp.18-23 |
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] |
2022-06-28 15:50 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Causal Discovery in Discrete Data Using NML Code Length Based on MDL Principle Masatoshi Kobayashi, Nishimoto Hiroki, Shin Mastushima (Todai) NC2022-21 IBISML2022-21 |
Inference on the causal structure among random variables from only a finite number of observed data is one of the most i... [more] |
NC2022-21 IBISML2022-21 pp.149-155 |
COMP, IPSJ-AL |
2022-05-19 15:40 |
Online |
Online |
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5 |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] |
COMP2022-5 pp.33-38 |
COMP, IPSJ-AL |
2022-05-19 16:15 |
Online |
Online |
Information Theory of Evolution
-- The Driving Force of Saltative Evolution -- Kumon Tokumaru (Researcher) COMP2022-6 |
The evolution s from Prokaryote to Eukaryote and the birth of vertebrates are saltative. Plausibly they take place as sy... [more] |
COMP2022-6 pp.39-44 |
COMP, IPSJ-AL |
2022-05-20 14:10 |
Online |
Online |
Computational Power of A Memoryless Mobile Agent in Undirected Rings Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2022-8 |
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] |
COMP2022-8 pp.46-53 |
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 |
2022-03-06 10:30 |
Online |
Online |
EXPTIME-Completeness of Generalized Tsume-Chushogi Akihiro Uejima, Yuya Kiba, Junichi Omori, Masaaki Sato (Osaka Electro-Communication Univ.) COMP2021-32 |
We consider the `Tsume-ChuShogi' that restricted chushogi such that at every turn, the attack-side player (the first pla... [more] |
COMP2021-32 pp.8-15 |
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 |
TL |
2021-09-18 13:35 |
Online |
Online |
What is reading?
-- Techniques to Connect Text to In-Brain Networks -- Kumon Tokumaru (Writer) TL2021-12 |
Linguistic Information in text provides readers with phonetic stimuli. With reliability and co mplexity analyses, words ... [more] |
TL2021-12 pp.1-6 |
RCS |
2021-06-23 13:20 |
Online |
Online |
Investigation on Complexity Reduction in Peak Cancellation Signal-Based PAPR Reduction Method Using Null Space in MIMO Channel Kenta Hosoi (Tokyo Univ. of Science), Nobuhide Nonaka (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2021-38 |
In this paper, we propose an algorithm to further reduce the computational complexity of the peak-to-average power ratio... [more] |
RCS2021-38 pp.56-61 |
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] |
|
QIT (2nd) |
2021-05-25 10:30 |
Online |
Online |
On Efficiencies of Two TPCP maps Discrimination using Quantum Queries Takehisa Iwakoshi (Mie Univ.) |
This study analyses the efficiency of three strategies to discriminate two Trace-Preserving Completely Positive maps (TP... [more] |
|
QIT (2nd) |
2021-05-24 13:30 |
Online |
Online |
[Poster Presentation]
Poster Presentation: Adversary Bound for Inverting Permutations via Representation Theory Francois Le Gall, Ansis Rosmanis (Nagoya University) |
We study adversary lower bounds on the quantum query complexity of the problem of inverting a permutation. An adversary ... [more] |
|
WBS, IT, ISEC |
2021-03-04 11:45 |
Online |
Online |
Streaming Data Compression and Decompression by One-Way Quantum Finite-State Automata, Leading to Quantum Finite-State Deep and Shallow Information (Preliminary Report) Tomoyuki Yamakami (U of Fukui) IT2020-117 ISEC2020-47 WBS2020-36 |
The logical depth of a piece of data has served as a complexity measure to
describe the amount of “useful” and "non-ran... [more] |
IT2020-117 ISEC2020-47 WBS2020-36 pp.31-36 |
SIS |
2021-03-04 10:40 |
Online |
Online |
Effect of Environmental Sound from Outside of Building to Inside by Using Fractal Dimension Yoshiaki Makabe (Kanagawa Institute of Technology), Kenji Muto, Hideo Shibayama (Shibaura Institute of Technology), Tomoaki Kimura (Kanagawa Institute of Technology) SIS2020-40 |
We are conducting the study of evaluating method for environmental sound using complexity of time series wave of amplitu... [more] |
SIS2020-40 pp.27-32 |