| 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 # | |
| IE, MVE, CQ, IMQ (Joint) [detail] |
2024-03-13 14:30 |
Okinawa | Okinawa Sangyo Shien Center (Primary: On-site, Secondary: Online) |
Study on Evaluating the Effectiveness of Graph Summarization for Sampling Graphs Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.)  CQ2023-75 |
In recent years, a compact graph representation called {em summary graph} has been extensively studied. This representa... [more] | CQ2023-75 pp.26-31 |
| NS, IN (Joint) |
2024-03-01 10:10 |
Okinawa | Okinawa Convention Center | A Performance Evaluation of Graph Cutting Methods that Maintain the Shortest Paths in Internet Topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT) IN2023-90 |
The Internet is operated in units of autonomous systems (AS). By interconnecting multiple ASes, the ASes maintain commu... [more] |
IN2023-90 pp.148-153 |
| NS, IN (Joint) |
2024-03-01 09:45 |
Okinawa | Okinawa Convention Center | A Hop Count Reduction Method Using Helper Nodes in RangeKey Skip Graphs Robust to Data Changes Motoki Kurita, Akihiro Fujimoto (Wakayama Univ.), Hideki Tode (Osaka Metropolitan Univ.) NS2023-215 |
With the increase of IoT devices, P2P-based IoT platforms have been attracting attention because of their capabilities o... [more] | NS2023-215 pp.253-257 |
| IN, IA (Joint) |
2023-12-22 15:00 |
Hiroshima | Satellite Campus Hiroshima | [Short Paper]
A Study on the Applicability of Graph Reduction to Evaluating the Robustness of Complex Networks Murakawa Yamato, Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) IA2023-53 |
Generally, the computational complexity of network simulation and machine learning based on graph structure such as GNN ... [more] | IA2023-53 pp.48-52 |
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2023-11-16 15:55 |
Kumamoto | Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
Calculation of Isomorphic/Similar Topology using Graph Theory Yuto Moriguchi, Nobukazu Takai (KIT) VLD2023-55 ICD2023-63 DC2023-62 RECONF2023-58 |
In an automatic integrated circuit design, huge number of circuits are generated and simulated, so the efficiency of cir... [more] | VLD2023-55 ICD2023-63 DC2023-62 RECONF2023-58 pp.131-135 |
| IN, ICTSSL, IEE-SMF | 2023-10-20 13:40 |
Fukuoka | Fukuoka University | A study of graph cutting methods that maintain the shortest paths in Internet topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT) IN2023-38 |
According to the CAIDA Project survey, there are over 20,000 Autonomous Systems (AS), which are interconnected to form t... [more] | IN2023-38 pp.27-32 |
| NLP, CAS | 2023-10-07 13:40 |
Gifu | Work plaza Gifu | Expantion of Graph Fourier Transform Based on Degree of Freedom at Circuit Ports Ayumu Suzuki, Takashi Hisakado, Mahfuzul Islam (Kyoto Univ.) CAS2023-56 NLP2023-55 |
In this paper, we define the boundary condition of graph. Recently, graph signal processing is attracting attention. H... [more] |
CAS2023-56 NLP2023-55 pp.117-120 |
| NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] | 2023-06-30 10:45 |
Okinawa | OIST Conference Center (Primary: On-site, Secondary: Online) |
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time Convergence Yuki Takezawa, Ryoma Sato, Han Bao (Kyoto Univ./OIST), Kenta Niwa (NTT CS Lab.), Makoto Yamada (OIST) NC2023-14 IBISML2023-14 |
Decentralized learning has recently been attracting increasing attention for its applications in parallel computation an... [more] | NC2023-14 IBISML2023-14 pp.83-90 |
| CPSY, DC, IPSJ-ARC [detail] | 2023-06-05 14:40 |
Ehime | Nigitatsu-Kaikan (Primary: On-site, Secondary: Online) |
CPSY2023-3 DC2023-3 |
[more] | CPSY2023-3 DC2023-3 pp.8-13 |
| IN, IA (Joint) |
2022-12-13 10:40 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
On the Impact of Random Walk Laziness on Efficiency of Graph Exploration in Dynamic Graphs Daiki Nakagawa, Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-57 |
Graph exploration with a random walk has a wide range of engineering applications, and its mathematical properties have ... [more] | IA2022-57 pp.50-55 |
| IN, RCS, NV (Joint) |
2022-05-27 16:00 |
Kanagawa | Keio University (Hiyoshi Campus) (Primary: On-site, Secondary: Online) |
Apporoximation Betweenness Centrality focusing on paths affected by the connection of two graph Kaito Miyakoshi, Kunitake Kaneko (Keio Univ.) IN2022-11 |
Betweenness Centrality(BC) is an importance measure that expresses the number of times a target vertex is included in th... [more] | IN2022-11 pp.50-55 |
| 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 |
| ICM | 2022-03-04 13:25 |
Online | Online | Proposal of Fault Investigation Range Search Method in case of Network Failure Event Seiji Sakuma, Ryosuke Sato, Mizuto Nakamura, Kyoko Yamagoe (NTT) ICM2021-53 |
Telecommunications carriers have investigated automating network operations such as failure recovery over the years. Whe... [more] | ICM2021-53 pp.57-62 |
| COMP | 2021-12-03 10:00 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
On the average shortest path length of Host-Switch graphs with diameter 4 Daiki Shimizu, Yosuke Kikuchi (NIT, Tsuyama College) COMP2021-21 |
In recent research on network topology, there are some studies that deal with graphs more faithful to real-world network... [more] | COMP2021-21 pp.1-8 |
| SITE, ISEC, LOIS | 2021-11-12 13:25 |
Online | Online | Zero-Knowledge Proof of Isolation in Graph with Strong Secrecy Tomoki Murakami, Toru Nakanishi, Katsunobu Imai (Hiroshima Univ.) ISEC2021-42 SITE2021-36 LOIS2021-25 |
Network systems can be represented using graphs. What is important for a tenant is that his system is well connected (co... [more] | ISEC2021-42 SITE2021-36 LOIS2021-25 pp.7-12 |
| PN, NS, OCS (Joint) |
2021-06-25 11:10 |
Online | Online | Spectral clustering with an autonomous distributed manner for hierarchical routing of MANET Naoki Matsuhashi (Tokyo Metropolitan Univ.), Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.) NS2021-30 |
MANET is a communication system that does not depend on the communication infrastructure and is expected to be a means o... [more] | NS2021-30 pp.27-32 |
| EA, US, SP, SIP, IPSJ-SLP [detail] | 2021-03-03 10:00 |
Online | Online | A Constrained Alternating Minimization Approach to End-to-End Graph Signal Denoising Eisuke Yamagata, Shunsuke Ono (Titech) EA2020-59 SIP2020-90 SP2020-24 |
This paper proposes a denoising method for smooth graph signals observed on a graph of unknown topology. The proposed me... [more] | EA2020-59 SIP2020-90 SP2020-24 pp.1-4 |
| COMP, IPSJ-AL | 2020-09-02 11:00 |
Online | Online | Tree-Based Asynchronous Data Transmission with Delay for Healthcare Sensor Networks Susumu Shibusawa (Ibaraki Univ.), Toshiya Watanabe (NIT, Gunma College) COMP2020-9 |
The ability to obtain health-related information at any time through the use of sensor network technology for healthcare... [more] | COMP2020-9 pp.25-32 |
| CQ | 2020-07-17 14:15 |
Online | Online | High Reliability Network Design Problem Considering Reduction Cost of Failure Probability of Simultaneous Failure Sets Yuma Morino, Hiroyoshi Miwa (Kwansei Gakuin Univ.) CQ2020-33 |
It is important to design a robust information network resistant to network failures. The protection method to decrease ... [more] | CQ2020-33 pp.63-68 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2020-03-06 10:45 |
Fukuoka | Kyushu Institute of Technology (Cancelled but technical report was issued) |
Accurate OD Traffic Matrix Estimation Using Pseudo Network Topology Yohei Hasegawa, Masato Uchida (Waseda Univ.) CQ2019-150 |
In this paper, we consider the problem of estimating the traffic rate of every unobservable global flow (individual-flow... [more] | CQ2019-150 pp.81-86 |
[Return to Top Page]