| 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 # | |
| NLP, MSS (Joint) |
2021-03-15 13:00 |
Online | Online | Proposal of Novel Distributed Learning Algorithms for Multi-Neural Networks Kazuaki Harada, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  NLP2020-58 |
A method for multiple neural networks (NNs) with the same structure to learn multiple sets of training data collected at... [more] | NLP2020-58 pp.17-22 |
| MSS, CAS, IPSJ-AL [detail] | 2020-11-25 16:35 |
Online | Online | Generalization of Pseudo-Decentralized Continuous-Time Algorithms for Estimation of Algebraic Connectivity Katsuki Shimada, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2020-23 MSS2020-15 |
Development of decentralized algorithms for multiple agents in a network to estimate its connectivity is a fundamental a... [more] | CAS2020-23 MSS2020-15 pp.22-27 |
| MSS, CAS, IPSJ-AL [detail] | 2020-11-25 17:00 |
Online | Online | Distributed Algorithms based on Multiplicative Update Rules for Nonnegative Matrix Factorization Yohei Domen, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2020-24 MSS2020-16 |
Nonnegative matrix factorization (NMF) is a multivariate method that approximates a given nonnegative matrix by the prod... [more] | CAS2020-24 MSS2020-16 pp.28-33 |
| MSS, NLP (Joint) |
2020-03-09 09:50 |
Aichi | (Cancelled but technical report was issued) |
A Distributed Algorithm for Solving Sandberg-Willson Equations Based on Sequential Minimization of Convex Quadratic Functions Masaaki Takeuchi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2019-115 |
We propose a new distributed algorithm for multi-agent networks to solve Sandberg-Willson equations, which are well-know... [more] | NLP2019-115 pp.13-18 |
| MSS, NLP (Joint) |
2020-03-09 10:15 |
Aichi | (Cancelled but technical report was issued) |
A projected consensus-based algorithm for minimizing the maximum error of a system of linear equations with nonnegativity constraints Kosuke Kawashima, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2019-116 |
If a system of linear equations with nonnegativity constraints has a solution then it can be considered as a constrained... [more] | NLP2019-116 pp.19-23 |
| NLP | 2018-08-09 09:55 |
Kagawa | Saiwai-cho Campus, Kagawa Univ. | A Convergence Condition for the Projected Consensus Algorithm on a Network with a Fixed Topology Kosuke Kawashima, Norikazu Takahashi (Okayama Univ.) NLP2018-65 |
This report studies the problem of making the states of all agents in a network converge to the same point in the inters... [more] | NLP2018-65 pp.63-68 |
| NLP | 2018-04-27 14:45 |
Kumamoto | Kumaoto Univ. | A Distributed Algorithm for Multi-Agent Networks to Solve Sandberg-Willson Equations Masaaki Takeuchi, Norikazu Takahashi (Okayama Univ.) NLP2018-23 |
We propose a distributed algorithm for multi-agent networks to solve Sandberg-Willson equations, which are well-known in... [more] | NLP2018-23 pp.111-116 |
| MBE, NC, NLP (Joint) |
2018-01-26 13:00 |
Fukuoka | Kyushu Institute of Technology | Equilibrium Point Analysis of a Truly Decentralized Discrete-Time Algorithm for Algebraic Connectivity Estimation Kento Endo, Norikazu Takahashi (Okayama Univ.), Sang-Gu Lee (Sungkyunkwan Univ.) NLP2017-89 |
The second smallest eigenvalue of the Laplacian matrix of a network, also known as the algebraic connectivity, is an ind... [more] | NLP2017-89 pp.17-22 |
| NLP | 2017-05-11 15:35 |
Okayama | Okayama University of Science | A Pseudo-Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks Tomohisa Urakami, Norikazu Takahashi (Okayama Univ.) NLP2017-12 |
The algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, is ... [more] | NLP2017-12 pp.57-62 |
| NLP | 2016-09-15 10:00 |
Hyogo | Konan Univ. | A consideration on complete multipartite graphs that maximize the algebraic connectivity over all graphs with the same number of vertices and edges Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP2016-54 |
The second smallest eigenvalue of the Laplacian matrix of a graph, also known as the algebraic connectivity, is an impor... [more] | NLP2016-54 pp.51-56 |
| NLP | 2016-09-15 10:25 |
Hyogo | Konan Univ. | A New Decentralized Discrete-Time Algorithm for Estimating Algebraic Connectivity of Multiagent Networks Kento Endo, Norikazu Takahashi (Okayama Univ.) NLP2016-55 |
The algebraic connectivity, which is defined as the second smallest eigenvalue of the Laplacian matrix, is an index repr... [more] | NLP2016-55 pp.57-62 |
| RCC | 2016-01-29 15:05 |
Osaka | Kansai University Umekita Laboratory | Maximality of the Algebraic Connectivity of Complete Multipartite Graphs and a 2-Switch-Based Method for Finding Algebraic Connectivity Locally Maximizing Graphs Takuro Fujihara, Norikazu Takahashi (Okayama Univ.) RCC2015-92 |
How to reach a consensus is an important problem for multiagent networks. In the most well-known consensus algorithm pro... [more] | RCC2015-92 pp.31-36 |
| NLP, CCS | 2015-06-12 09:00 |
Tokyo | Waseda Univerisity | Proposal of a Truly Distributed Algorithm for Estimating Algebraic Connectivity of Multi-Agent Network Kazuma Yamane, Norikazu Takahashi (Okayama Univ.) NLP2015-54 CCS2015-16 |
The algebraic connectivity, which is defined by the second smallest eigenvalue of the Laplacian matrix, is an index repr... [more] | NLP2015-54 CCS2015-16 pp.91-96 |
| NLP | 2014-05-26 15:25 |
Shimane | Big Heart IZUMO | A 2-switch-based method for searching algebraic connectivity maximizing graphs and its application to 3-regular graphs Takuro Fujihara, Norikazu Takahashi (Okayama Univ.) NLP2014-4 |
How to reach a consensus is an important problem in multiagent networks. In a representative consensus protocol proposed... [more] | NLP2014-4 pp.19-24 |
[Return to Top Page]