IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 21 - 40 of 146 [Previous]  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IN, RCS, NV
(Joint)
2022-05-26
11:50
Kanagawa Keio University (Hiyoshi Campus)
(Primary: On-site, Secondary: Online)
Application of Darwinian Neurodynamics Model for Dynamic TDD Resource Allocation
Lu Chen, Masayuki Murata (Osaka Univ.) IN2022-3
Following the launch of 5G mobile network services, private 5G networks are getting started to be available, and have a ... [more] IN2022-3
pp.13-18
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]
QIT
(2nd)
2021-11-30
09:50
Online Online Study on quantum algorithms for gradient estimation of integer polynomials
Shinichi Mizuhara (Univ. of Tokyo), Yutaro Iiyama (ICEPP), Shoji Asai (Univ. of Tokyo)
Although efficient quantum algorithms for computing gradients of real functions already exist, they tend to be applicabl... [more]
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] 2021-06-28
13:50
Online Online Simplification of Average Consensus Algorithm in Distributed HALS Algorithm for NMF
Keiju Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NC2021-3 IBISML2021-3
Nonnegative Matrix Factorization (NMF) is the process of approximating a given nonnegative matrix by the product of two ... [more] NC2021-3 IBISML2021-3
pp.15-22
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
SDM 2021-06-22
17:10
Online Online Influence of quantized bit precision and bit-error rate in Computation-in-Memory with ReRAM on optimal answers of combinatorial optimization problems
Naoko Misawa, Kenta Taoka, Shunsuke Koshino, Chihiro Matsui, Ken Takeuchi (Univ. Tokyo) SDM2021-28
The knapsack problem, one of combinatorial optimization problems, is solved effectively by simulated annealing in ReRAM ... [more] SDM2021-28
pp.23-26
COMP, IPSJ-AL 2021-05-08
11:30
Online Online Experimental analysis of a classical algorithm spoofing linear cross-entropy benchmarking
Kensuke Suzuki, Akinori Kawachi (Mie Univ.) COMP2021-7
Quantum computers are expected to be exponentially faster than classical computers in a specific computational task (qua... [more] COMP2021-7
pp.46-53
COMP, IPSJ-AL 2021-05-08
13:30
Online Online [Invited Talk] Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project
Shin-ichi Minato (Kyoto Univ.) COMP2021-8
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] COMP2021-8
p.54
IN, CCS
(Joint)
2020-08-03
13:25
Online Online A Study on Recovery from Packet Forwarding Errors Caused by Mutual-Exclusion-free PIT of a Multi-core NDN Router
Ryo Koyama (Osaka Univ.), Junji Takemasa (KDDI Research, Inc.), Yuki Koizumi (Osaka Univ.), Atsushi Tagami (KDDI Research, Inc.), Toru Hasegawa (Osaka Univ.) IN2020-14
A Named Data Networking (NDN) router stores incoming faces from which Interest packets are received at a Pending Interes... [more] IN2020-14
pp.31-36
RCS 2020-06-25
13:25
Online Online PC-Signal-Based PAPR Reduction Using Null Space in MIMO Channel for MIMO-OFDM Signals under Frequency-Selective Fading Channel
Leon Yamaguchi (Tokyo Univ. of Science), Nobuhide Nonaka (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2020-36
In this paper, we propose a computational complexity-efficient algorithm for the adaptive peak-to-average power ratio (P... [more] RCS2020-36
pp.79-84
R 2020-06-11
15:15
Online Online Comparison of Computation Algorithms for Poisson Binomial Distributions
Yuma Sakata, Tadashi Dohi, Hiroyuki Okamura (Hiroshima U.) R2020-4
In this article, we focus on the computation algorithms of Poisson binomial distributions, and compare the
well-known ... [more]
R2020-4
pp.21-26
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
IT, SIP, RCS 2020-01-23
10:50
Hiroshima Hiroshima City Youth Center Parallelly Processed Adaptive PAPR Reduction Method Using Null Space in MIMO Channel based on Peak Cancellation Signal for MIMO-OFDM Signals
Taku Suzuki, Mikihito Suzuki, Kenichi Higuchi (Tokyo Univ. of Science) IT2019-42 SIP2019-55 RCS2019-272
In this paper,an algorithm to reduce the required iterations for the peak-to-average power ratio (PAPR) reduction is pro... [more] IT2019-42 SIP2019-55 RCS2019-272
pp.37-43
QIT
(2nd)
2019-11-18
11:00
Tokyo Gakushuin University [Invited Talk] Simulated bifurcation algorithm -- Combinatorial optimization based on classical adiabatic evolution --
Hayato Goto (Toshiba)
We have recently proposed a heuristic algorithm for combinatorial optimization, which is based on the numerical simulati... [more]
QIT
(2nd)
2019-11-18
13:50
Tokyo Gakushuin University [Poster Presentation] Quantum algorithm for collision steps in lattice Boltzmann method
Ryo Omori, Yuji Nakanishi, Masahiro Tanaka, Satoru Takanezawa (Daikin)
A quantum algorithm which simulates fluid flows based on the lattice Boltzmann method (LBM) is developed. LBM is the met... [more]
RCS 2019-06-20
09:40
Okinawa Miyakojima Hirara Port Terminal Building Investigation on Efficient Construction Scheme of Peak Cancellation Signals in Complexity-Reduced PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals
Taku Suzuki, Mikihito Suzuki (Tokyo Univ. of Science), Yoshihisa Kishiyama (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2019-64
In this paper, we investigate efficient construction schemes of the peak cancellation (PC) signals in the complexity-red... [more] RCS2019-64
pp.161-167
RCS 2019-06-21
15:25
Okinawa Miyakojima Hirara Port Terminal Building Complexity-Reduced Algorithm for Adaptive PAPR Reduction Method Using Null Space in MIMO Channel for MIMO-OFDM Signals
Mikihito Suzuki, Taku Suzuki (Tokyo Univ. of Science), Yoshihisa Kishiyama (NTT DOCOMO), Kenichi Higuchi (Tokyo Univ. of Science) RCS2019-97
In this paper, we propose a computational complexity-reduced algorithm for our previously reported adaptive peak-to-aver... [more] RCS2019-97
pp.353-358
PRMU, IPSJ-CVIM 2019-05-30
11:05
Tokyo   Suppression of False Alarms of Video Beef Cattle Calving Detection System Using Crowdsourcing for Rapid Deployment
Yusuke Okimoto, Susumu Saito (Waseda Univ.), Teppei nakano, Makoto Akabane (Waseda Univ./iflab, inc.), Tetsunori Kobayashi, Tetsuji Ogawa (Waseda Univ.) PRMU2019-2
For rapid deployment of the beef cattle calving detection system by video, it is verified whether the system with crowds... [more] PRMU2019-2
pp.7-12
QIT
(2nd)
2019-05-21
16:10
Fukuoka Kyushu University, Chikushi Campus Exponential-Time Quantum Algorithm for Graph Coloring Problem
Kazuya Shimizu, Ryuhei Mori (TiTech)
In this work, we show an exponential-time quantum algorithm for the graph k-coloring problem, which is one of the well-k... [more]
IEE-CMN, EMM, LOIS, IE, ITE-ME [detail] 2018-09-27
13:50
Oita Beppu Int'l Convention Ctr. aka B-CON Plaza Image Patch Modeling in Encrypted Domain using Sparse Coding
Takayuki Nakachi (NTT), Hitoshi Kiya (Tokyo Metro. Univ.) LOIS2018-12 IE2018-32 EMM2018-51
Sparse coding represents observed signals effectively as a linear combination of a small number of bases which are chose... [more] LOIS2018-12 IE2018-32 EMM2018-51
pp.13-18
 Results 21 - 40 of 146 [Previous]  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan