| 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 # | |
| EA, SIP, SP | 2019-03-15 13:30 |
Nagasaki | i+Land nagasaki (Nagasaki-shi) | [Poster Presentation]
Simultaneous Japanese Flexible-Keyword Detection and Speaker Recognition for Low-Resource Devices Hiroshi Fujimura (TOSHIBA)  EA2018-157 SIP2018-163 SP2018-119 |
We propose a novel method of simultaneous keyword detection and speaker recognition for low resource devices in this stu... [more] | EA2018-157 SIP2018-163 SP2018-119 pp.341-346 |
| COMP | 2018-10-26 15:00 |
Kyoto | Kyoto University | Upper and lower bounds on the OBDD-width of a special integer multiplication Tong Qin (Tokyo Tech) COMP2018-27 |
We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural num... [more] | COMP2018-27 pp.45-54 |
| COMP, IPSJ-AL | 2018-05-26 13:30 |
Aichi | Nagoya Institute of Technology | Strip flat folding with parallel oblique mountain-valley-assigned creases Hiro Ito (UEC), Chie Nara (Meiji Univ.), Izumi Shirahama (ECBEING), Mizuho Tomura (UEC) COMP2018-4 |
The flat foldability problem is a typical problem of origami mathematics, which asks whether or not a given paper with c... [more] | COMP2018-4 pp.63-70 |
| ISEC | 2018-05-16 16:00 |
Tokyo | Ookayama Campus, Tokyo Institute of Technology | [Invited Talk]
Quantum Multicollision Finding Algorithm
-- from ASIACRYPT 2017 -- Akinori Hosoyamada, Yu Sasaki, Keita Xagawa (NTT) ISEC2018-10 |
We introduce the paper ``Quantum Multicollision Finding Algorithm'' by Akinori Hosoyamada, Yu Sasaki, Keita Xagawa, whic... [more] | ISEC2018-10 p.59 |
| RCS | 2017-10-20 13:00 |
Miyagi | Tohoku Institute of Technology | [Invited Lecture]
Self-Interference Cancellation for In-Band Full-Duplex Yuichi Miyaji, Kazuki Komatsu, Hideyuki Uehara (Toyohashi Univ. of Tech.) RCS2017-193 |
In-band full duplex, which is a new communication system attracting attention for 5G and beyond, can transmit and receiv... [more] | RCS2017-193 p.141 |
| NS, IN (Joint) |
2017-03-03 09:30 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL | Flow Discarding Method in WRR Weight Assignment Method Sho Noda, Katsunori Yamaoka (Tokyo Tech) IN2016-123 |
Our conventional method, approaching to optimal WRR weight assignment method in delay-limited environment, does not cons... [more] | IN2016-123 pp.157-162 |
| SP, SIP, EA | 2017-03-01 15:15 |
Okinawa | Okinawa Industry Support Center | Study on a Reduction of Calculated Amount in a Time-Domain Blind Source Separation Tsubasa Inoue (NIT) EA2016-112 SIP2016-167 SP2016-107 |
This paper describes the method for separating the voices using a time-domain Blind Source Separation (BSS) algorithm. E... [more] | EA2016-112 SIP2016-167 SP2016-107 pp.171-176 |
| 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 |
|
| COMP | 2016-10-21 13:30 |
Miyagi | Tohoku University | Physical Bucket Sort with Two Kinds of Items Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC) COMP2016-26 |
Bucket sort is one of the most famous sorting algorithms, and it runs in time $O(k+n)$, where $k$ is the number of bucke... [more] | COMP2016-26 pp.23-27 |
| COMP | 2016-10-21 14:00 |
Miyagi | Tohoku University | An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits. Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII) COMP2016-27 |
A Boolean function $f: bits{n} to bit$ is {em weighted symmetric} if there exist a function $g: mathbb{Z} to bit$ and i... [more] |
COMP2016-27 pp.29-34 |
| 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 | 2016-04-22 14:30 |
Nara | Physical Bucket Sort John Iacono (NY Univ.), Hiro Ito, Atsuki Nagao, Junji Nishino (UEC), David Rappaport (Queen's Univ.) COMP2016-5 |
Bucket sort is one of the most famous sorting algorithm, which runs in O(k + n)-time where k is the number of buckets an... [more] | COMP2016-5 pp.29-34 |
|
| AP | 2016-02-19 15:10 |
Fukushima | Iwaki (Spa Resort Hawaiians) | Proposal on Novel Ray-Launching Method with Quasi-Uniform Spatial Resolution, and its Effect on Calculation Amount Reduction Tetsuro Imai, Nobutaka Omaki, Yukihiko Okumura (DOCOMO) AP2015-203 |
Currently, ray-tracing method came to be commonly used to radio propagation analysis. Ray-launching method is one of tec... [more] | AP2015-203 pp.71-76 |
| 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 |
| 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 |
| 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 |
|
| ISEC, IT, WBS | 2015-03-02 15:10 |
Fukuoka | The University of Kitakyushu | A Study of Two-dimensional Antidictionary Coding Using Automata Takahiro Ota (NPIT), Hiroyoshi Morita (UEC) IT2014-78 ISEC2014-91 WBS2014-70 |
In one dimension, for an input string, an antidictionary is the set of all the minimal strings which do not appear in th... [more] | IT2014-78 ISEC2014-91 WBS2014-70 pp.103-109 |
| SIP, RCS | 2015-01-23 14:35 |
Okayama | Okayama Univ. | Performance Evaluation of a Reduced-Complexity Detection Based on Symbol Distribution Approximation for a 3x3 MIMO Spatial Multiplexing System Kento Yoshizawa, Hideki Ochiai (YNU) SIP2014-110 RCS2014-298 |
We evaluate the performance of the recently proposed MIMO detection scheme based on symbol distribution approximation (S... [more] | SIP2014-110 RCS2014-298 pp.169-174 |
| COMP | 2014-12-05 11:00 |
Kumamoto | Sojo University | On Zero-Suppressed Binary Decision Diagrams and Complexity Theory Hiroki Morizumi (Shimane Univ.) COMP2014-34 |
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most... [more] | COMP2014-34 pp.17-19 |
[Return to Top Page]