| 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 # | |
| SIP | 2017-08-24 14:40 |
Tokyo | Tokyo Denki University | Computational Complexity Reduction for Third-order Volterra Filter Based on Singular Value Decomposition and the Application to the Compensation of Third-order Nonlinear Distortions Yuya Nakahira, Kenta Iwai, Yoshinobu Kajikawa (Kansai Univ.)  SIP2017-53 |
Nonlinear distortions of loudspeaker systems affect the sound quality and should be accordingly compensated by any lin... [more] |
SIP2017-53 pp.27-32 |
| CAS, CS | 2017-02-24 16:25 |
Shiga | A Study on Computational Complexity Reduction of Orthogonal Precoding for Sidelobe Suppression of OFDM Signals Hikaru Kawasaki, Takahiro Matsui, Masaya Ohta, Katsumi Yamashita (OPU) CAS2016-136 CS2016-97 |
N-continuous OFDM is a precoding method for sidelobe suppression of orthogonal frequency division multiplexing (OFDM) si... [more] | CAS2016-136 CS2016-97 pp.123-127 |
|
| MSS, SS | 2017-01-27 10:00 |
Kyoto | Kyoto Institute of Technology | A Design of Multi-layer Cellular Automata Simulator and Its Application Naoki Kamikawa, Hiroshi Umeo (Osaka Electro-Communication Univ.) MSS2016-69 SS2016-48 |
A model of cellular automata (CA) is considered to be a well-studied non-linear model of complex systems in which an inf... [more] | MSS2016-69 SS2016-48 pp.71-76 |
| IT, SIP, RCS | 2017-01-19 13:05 |
Osaka | Osaka City Univ. | A small computation algorithm of the LRLS filter with its short length Eisuke Horita (Kanazawa Univ.) IT2016-64 SIP2016-102 RCS2016-254 |
The leaky recursive least-squares (LRLS) filter whose computational complexity is quadratic in its filter's length $N$ ... [more] |
IT2016-64 SIP2016-102 RCS2016-254 pp.105-110 |
| COMP | 2016-10-21 14:30 |
Miyagi | Tohoku University | On lower bounds for the complexity of the Frobenius problem and its subproblems Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-28 |
In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive in... [more] | COMP2016-28 pp.35-37 |
| COMP | 2016-09-06 11:30 |
Toyama | Toyama Prefectural University | On the inapproximability of the Frobenius problem and its relationship with the covering radius problem Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-16 |
Given coprime positive integers $a_1,cdots,a_n$, we call the problem that asks the maximum integer among all positive in... [more] | COMP2016-16 pp.15-16 |
| CQ | 2016-07-27 14:50 |
Osaka | The Osaka Umeda Campus, Kwansei Gakuin Univesity | A New Matrix Approach for Differential Calculus and Its Application to Reliability Engineering Akitoshi Wada, Masahiro Hayashi (Tokyo City Univ.) CQ2016-43 |
This paper proposes a new approach for executing differential calculus using simple two by two matrices and demonstrate ... [more] | CQ2016-43 pp.61-66 |
| COMP, IPSJ-AL | 2016-06-24 13:45 |
Ishikawa | On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-7 |
The polynomial-time hierarchy was introduced by Meyer and Stockmeyer, which is a hierarchy on decision problems and has ... [more] | COMP2016-7 pp.9-12 |
|
| PRMU, IPSJ-CVIM, MVE [detail] | 2016-01-22 15:35 |
Osaka | A Note on the Computational Complexity Reduction Method of the Optimal Prediction under Bayes Criterion in Semi-Supervised Learning Yuto Nakano, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) PRMU2015-130 MVE2015-52 |
In this paper, we deal with a prediction problem of the semi-supervised learning based on the statistical decision theor... [more] | PRMU2015-130 MVE2015-52 pp.275-280 |
|
| IT | 2015-11-24 13:35 |
Okayama | Shimoden Hotel | [Invited Talk]
A Short Introduction to Communication Complexity Taisuke Izumi (NITECH) IT2015-44 |
Communication Complexity is a theory to reveal the necessary number of bits exchanged among serveral parties for comput... [more] |
IT2015-44 pp.1-6 |
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| COMP | 2015-09-01 10:30 |
Nagano | Impossibility of Classically Simulating One-Clean-Qubit Computation Keisuke Fujii (Kyoto Univ.), Hirotada Kobayashi (NII), Tomoyuki Morimae (Gunma Univ.), Harumichi Nishimura (Nagoya Univ.), Shuhei Tamate (NII), Seiichiro Tani (NTT) COMP2015-17 |
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input... [more] | COMP2015-17 pp.5-12 |
|
| NC, IPSJ-BIO, IBISML, IPSJ-MPS (Joint) [detail] |
2015-06-25 09:55 |
Okinawa | Okinawa Institute of Science and Technology | Computational Complexity Reduction for Functional Connectivity Estimation in Large Scale Neural Network JeongHun Baek, Shigeyuki Oba (Kyoto Univ.), Junichiro Yoshimoto, Kenji Doya (OIST), Shin Ishii (Kyoto Univ.) IBISML2015-22 |
Identification of functional connectivity between neurons is an important issue in computational neu- roscience. Recentl... [more] | IBISML2015-22 pp.181-185 |
| NLP, CCS | 2015-06-12 09:50 |
Tokyo | Waseda Univerisity | A Note on Sequences Generated by Small Cellular Automata Naoki Kamikawa, Hiroshi Umeo (O.E.C.U.) NLP2015-56 CCS2015-18 |
A model of cellular automata (CA ) is considered to be a well-studied non-linear model of complex systems in which an in... [more] | NLP2015-56 CCS2015-18 pp.103-108 |
| EMM, IT | 2015-05-22 10:00 |
Kyoto | Kyoto International Community House | On the Computational Complexity of Information Flow Problem with Hierarchy Constraint Yuki Takeda, Yuichi Kaji, Minoru Ito (NAIST) IT2015-11 EMM2015-11 |
An information flow problem discusses how to distribute information over a complicated network. It is known that the te... [more] | IT2015-11 EMM2015-11 pp.57-62 |
| COMP | 2015-04-23 15:25 |
Miyagi | Computational Complexity of Generalized Makespan Minimization Problem Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo) COMP2015-4 |
We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan mi... [more] | COMP2015-4 pp.21-25 |
|
| SIP, EA, SP | 2015-03-03 10:45 |
Okinawa | [Poster Presentation]
Compensation of Nonlinear Distortions for Parametric Array Loudspeakers
-- Reduction of Computational Complexity of Volterra Filters and the Compensation Effects -- Yuta Hatano, Satoshi Kinoshita, Chuang Shi, Yoshinobu Kajikawa (Kansai Univ.) EA2014-119 SIP2014-160 SP2014-182 |
Reproduction sound of the parametric array loudspeaker (PAL) contains many nonlinear distortions. Therefore we proposed ... [more] | EA2014-119 SIP2014-160 SP2014-182 pp.261-266 |
|
| COMP | 2014-12-05 13:55 |
Kumamoto | Sojo University | Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-36 |
In this paper, we investigate conditions to compute nonnegative integer combinations for a given set of positive integer... [more] | COMP2014-36 pp.23-27 |
| COMP | 2014-09-02 13:30 |
Aichi | Toyohashi University of Technology | [Invited Talk]
Modeling and Algorithm/Complexity Theory
-- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples -- Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2014-19 |
This paper discuss and suggest how knowledge on algorithm design theory and computational complexity theory help to mo... [more] | COMP2014-19 pp.29-34 |
| COMP | 2014-09-02 15:45 |
Aichi | Toyohashi University of Technology | A Note on the Class of the Computational Comlexity of the Coin-Exchange Problem of Frobenius Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-22 |
The coin-exchange problem of Frobenius is a problem that determines whether the Frobenius number for given relatively pr... [more] | COMP2014-22 pp.51-54 |
[Return to Top Page]