| 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 # | |
| MIKA (3rd) |
2024-03-27 13:30 |
Fukuoka | [Invited Talk]
Radio Propagation Path Finding Model Applicable to Quantum Computers Tetsuro Imai (Tokyo Denki Univ.), Minoru Inomata, Wataru Yamada (NTT) |
Radio wave propagation analysis in a multipath environment is based on finding radio wave propagation paths between tran... [more] | ||
| NLP, MSS | 2024-03-14 11:15 |
Misc. | Kikai-Shinko-Kaikan Bldg. | Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] | MSS2023-89 NLP2023-141 pp.87-92 |
| COMP | 2023-12-22 11:25 |
Miyazaki | Miyazaki Univ. Machinaka Campus | [Invited Talk]
Fast Algorithms for Maximum Matching Problem Yutaro Yamaguchi (Osaka Univ.) COMP2023-19 |
Initiated by Edmonds' blossom algorithm (1965), a variety of algorithms for finding a maximum matching in general graphs... [more] | COMP2023-19 p.20 |
| AP | 2023-10-19 10:00 |
Iwate | Iwate University (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Preliminary Study of Angle-of-Arrival based Indoor Localization Methods using Distributed MIMO Sensors Koularp Thongsavanh, Togo Ikegami, Minseok Kim (Niigata Univ.) AP2023-91 |
In recent years, the proliferation of smart devices, the Internet of Things (IoT), and the increasing need for seamless ... [more] | AP2023-91 pp.19-24 |
| ICM | 2023-07-13 14:50 |
Hokkaido | Sun Reflation Hakodate (Primary: On-site, Secondary: Online) |
Optimal scheduling of Multipath Multicast with In-network Cache for One-to-many Transfer Ryota Fukuda, Masahiro Shibata, Masato Tsuru (KIT) ICM2023-15 |
The need for fast and efficient one-to-many file transfers is growing to cope with the rapid increase in traffic due to ... [more] | ICM2023-15 pp.25-30 |
| CCS, NLP | 2022-06-09 17:40 |
Osaka | (Primary: On-site, Secondary: Online) |
Speeding up an algorithm for searching generalized Moore graphs Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2022-11 CCS2022-11 |
Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) ... [more] | NLP2022-11 CCS2022-11 pp.52-57 |
| NS | 2022-04-15 11:10 |
Tokyo | kikai shinkou kaikan + online (Primary: On-site, Secondary: Online) |
Service Chaining Based on Capacitated Shortest Path Tour Problem
-- Solution Based on Deep Reinforcement Learning and Graph Neural Network -- Takanori Hara, Masahiro Sasabe (NAIST) NS2022-2 |
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] | NS2022-2 pp.7-12 |
| IN, NS, CS, NV (Joint) |
2021-09-09 12:40 |
Online | Online | Service Chaining Based on Capacitated Shortest Path Tour Problem
-- Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm -- Takanori Hara, Masahiro Sasabe (NAIST) NS2021-60 |
Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional networ... [more] | NS2021-60 pp.18-23 |
| SWIM, SC | 2021-08-27 10:25 |
Online | Online | Combining Multiagent Reinforcement Learning and Discrete Event Modeling for Pathfinding on a Non-Grid Graph Shiyao Ding (Kyoto Univ.), Hideki Aoyama (Panasonic), Donghui Lin (Kyoto Univ.) SWIM2021-15 SC2021-13 |
In this report, we study a new multiagent path finding (MAPF) problem where multiple agents move on a non-grid graph wit... [more] | SWIM2021-15 SC2021-13 pp.13-17 |
| MI | 2021-05-17 11:00 |
Online | Online | [Short Paper]
Watershed-based Alveoli Segmentation from Micro-focus X-ray CT Volumes of Dissected Human Lungs Takeru Shiina, Hirohisa Oda, Tong Zheng, Shota Nakamura, Masahiro Oda, Kensaku Mori (Nagoya Univ.) MI2021-3 |
We propose a segmentation method of the alveoli from μCT volumes. The peripheral lung mainly consists of tiny spherical ... [more] | MI2021-3 pp.9-10 |
| IA | 2020-10-01 16:25 |
Online | Online | [Poster Presentation]
A Study on Topology Estimation from Observed Network Flows Keita Kitaura, Ryotaro Matsuo (Kwansei Gakuin Univ.), Ryo Nakamura (Fukuoka Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2020-11 |
Acquisition and estimation of topologies of large-scale evolving networks such as communication networks and social net... [more] |
IA2020-11 p.31 |
| NLP | 2020-05-15 13:00 |
Online | Online | A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3 |
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] | NLP2020-3 pp.11-16 |
| NLP, NC (Joint) |
2020-01-24 15:25 |
Okinawa | Miyakojima Marine Terminal | An Extension of the Multistate Network Model with a Self-Recovery Property to the Robot Arm Posture Problem in a Dynamic Environment Natsuki Shirasawa, Dondogjamts Batbaata (Kyutech), Keiichi Ueda (Univ. Toyama), Hiroaki Wagatsuma (Kyutech) NC2019-68 |
According to an ill-posed problem with a certain number of degrees of freedom in the case of determination of a posture ... [more] | NC2019-68 pp.51-56 |
| R | 2018-07-27 14:25 |
Hokkaido | Search process for multi-objective network by applying efficiency of path search in one-objective network Natsumi Takahashi, Shao-Chin Sung (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2018-12 |
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] | R2018-12 pp.7-12 |
|
| ICSS, IA | 2018-06-26 09:50 |
Ehime | Ehime University | Proposal of Sparse-Modeling based Approach for Betweenness Centrality Estimation Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2018-10 ICSS2018-10 |
In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations u... [more] | IA2018-10 ICSS2018-10 pp.61-66 |
| NLP, CCS | 2018-06-10 11:20 |
Kyoto | Kyoto Terrsa | Some Efficient Methods for Searching Generalized Moore Graphs Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP2018-43 CCS2018-16 |
Computer networks used for high performance computing are often modeled by undirected regular graphs, and the average sh... [more] | NLP2018-43 CCS2018-16 pp.85-90 |
| EA | 2018-02-15 15:30 |
Hiroshima | Pref. Univ. Hiroshima | Study on GUI of obstacle localization system using outdoor loudspeaker broadcasting Yuta Suzuki, Yoshifumi Chisaki (CIT) EA2017-95 |
The outdoor loudspeaker broadcasting plays an important role for evacuation recommendation and so on. Since one of the... [more] |
EA2017-95 pp.13-18 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 09:50 |
Hyogo | Kobe Institute of Computing | On the Complexity of Finding a Largest Common Subtree of Trees Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-70 MSS2016-50 |
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] | CAS2016-70 MSS2016-50 pp.89-92 |
| IA | 2016-11-03 14:10 |
Overseas | Taipei (Taiwan) | Performance Comparison of Shortest-Path Routing and Detour Routing for Content-Centric Networking Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2016-28 |
In this paper, we quantitatively investigate the optimality of the shortest-path routing in CCN (Content-Centric Networ... [more] |
IA2016-28 pp.13-18 |
| 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 |
[Return to Top Page]