| 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 |
| IE, MVE, CQ, IMQ (Joint) [detail] |
2024-03-15 13:10 |
Okinawa | Okinawa Sangyo Shien Center (Primary: On-site, Secondary: Online) |
A Voting-based Solution to Base Station Placement Problem Ryo Nakamura, Ryotaro Matsuo (Fukuoka Univ.), Toshiro Nakahira, Daisuke Murayama, Tomoaki Ogawa (NTT) CQ2023-85 |
With the rapid increase in wireless devices and the diversification of frequency band, the wireless network has become m... [more] | CQ2023-85 pp.75-80 |
| IN, IA (Joint) |
2023-12-21 15:55 |
Hiroshima | Satellite Campus Hiroshima | [Short Paper]
Study on the Effectiveness of Graph Summarization Methods for Sampling Graphs Hirosato Ito, Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) IA2023-46 |
In general, it is not trivial to obtain various large-scale graphs with graph structures such as communication networks ... [more] | IA2023-46 pp.17-19 |
| 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 |
| CQ, MIKA (Joint) (2nd) |
2023-08-30 15:00 |
Fukushima | Tenjin-Misaki Sports Park | [Poster Presentation]
A Study on the Applicability of Graph Coarsening to Evaluating Robustness of Complex Networks Yamato Murakawa, Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.) |
[more] | |
| CQ, MIKA (Joint) (2nd) |
2023-08-30 16:20 |
Fukushima | Tenjin-Misaki Sports Park | [Poster Presentation]
A Study on the Effectiveness of Graph Summarization Methods for Sampling Graphs Hirosato Ito, Ryotaro Matsuo, Ryo Nakmura (Fukuoka Univ.) |
[more] | |
| CQ, MIKA (Joint) (2nd) |
2023-08-31 10:00 |
Fukushima | Tenjin-Misaki Sports Park | [Invited Talk (Young Researcher)]
Applications of Sparse Modeling to Information Networking Problems Ryotaro Matsuo, Ryo Nakamura (Fukuoka Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) |
[more] | |
| CQ, MIKA (Joint) (2nd) |
2023-08-31 10:50 |
Fukushima | Tenjin-Misaki Sports Park | [Poster Presentation]
An Exploration of a Graph Super-Resolution Algorithm using Spectra and Degree Distributionof a Graph Super-Resolution Algorithm using Spectra and Degree Distribution Hiroyoshi Sawano (Kwansei Gakuin Univ), Ryotaro Matsuo (Fukuoka Univ), Hiroyuki Ohsaki (Kwansei Gakuin Univ) |
Generally, for large-scale and complex networks, obtaining information on the entire topology is not straightforward due... [more] | |
| IN, NS (Joint) |
2023-03-03 13:50 |
Okinawa | Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
On the Stability of Node Centrality Measures in Graph Coarsening Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) |
[more] | |
| IN, IA (Joint) |
2022-12-13 09:50 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
A Study on Obfuscation of Node Centrality in Large-Scale Networks Hiroki Kawamura, Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-55 |
Node centrality (e.g., degree centrality, eigenvector centrality, betweenness centrality), which is determined by the ne... [more] | IA2022-55 pp.40-46 |
| 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, IA (Joint) |
2021-12-17 12:40 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
A Study on First Passage Time and Cover Time of Non-backtracking Random Walk on a Graph Tetsuya Kawagishi, Jo Hagikura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-41 |
Recently, mathematical properties of random walks on a graph have been studied. Also, several extended models of a simp... [more] |
IA2021-41 pp.56-59 |
| IN, IA (Joint) |
2021-12-17 12:55 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Study on the Separability of Aggregated Multilayer Networks Rong Wang, Yuki Wakisaka, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-42 |
Many real networks consist of heterogeneous networks with different properties, and these heterogeneous networks interac... [more] | IA2021-42 pp.60-62 |
| IN, IA (Joint) |
2021-12-17 17:55 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
A Study on the Effect of Network Topology Coarsening on QoS of Communication Networks Hiroyoshi Sawano, Takeaki Iwata, Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-50 |
[more] | IA2021-50 pp.97-99 |
| IN, IA (Joint) |
2021-12-17 18:10 |
Hiroshima | Higashi-Senda campus, Hiroshima Univ. (Primary: On-site, Secondary: Online) |
[Short Paper]
Study on Improving the Characteristics of Random Walk on Graph using Q-learning Tomoyuki Miyashita, Taisei Suzuki, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-51 |
In recent years, modeling mobile agent on unknown graphs, such as random walks on graphs and understanding its mathemati... [more] | IA2021-51 pp.100-103 |
| CQ, MIKA (Joint) |
2021-09-09 11:35 |
Online | Online | On the Effectiveness of Breadth-First Search for Influence Maximization on Unknown Networks Yuki Wakisaka, Ryotaro Matsuo (Kwansei Gakuin Univ.), Sho Tsugawa (Tsukuba Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-42 |
Recently, the influence maximization problem for unknown networks has received much attention. The problem aims to ident... [more] | CQ2021-42 pp.29-34 |
| IA | 2021-09-08 10:05 |
Online | Online | On Accelerating Parallel Random Walks with Loose Cooperation Jo Hagikura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-15 |
[more] | IA2021-15 pp.1-6 |
| IA | 2021-09-08 10:30 |
Online | Online | Random Walk on Graphs with Vicinity Avoidance Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-16 |
A random walk on a graph is a mathematical mobility model that extends a random walk on a line or a plane to a graph. In... [more] | IA2021-16 pp.7-13 |
| IA, ICSS | 2021-06-22 11:15 |
Online | Online | A Solution for Recovering Missing Links in Network Topology using Sparse Modeling Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-14 ICSS2021-14 |
In recent years, sparse modeling, which is a statistical approach, has been applied to many practical problems mostly in... [more] | IA2021-14 ICSS2021-14 pp.74-79 |
| IA | 2020-10-01 13:15 |
Online | Online | A Study on Recovering Network Topology with Missing Links using Sparse Modeling Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2020-3 |
In recent years, sparse modeling, which is a statistical approach, has been applied to many practical problems mostly in... [more] | IA2020-3 pp.10-13 |
[Return to Top Page]