| Sparse representation of network topology with K-SVD algorithm R Matsuo, R Nakamura, H Ohsaki 2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC …, 2019 | 3 | 2019 |
| A study on sparse-modeling based approach for betweenness centrality estimation R Matsuo, R Nakamura, H Ohsaki 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC …, 2018 | 3 | 2018 |
| Random Walk on a Graph with Vicinity Avoidance K Kitaura, R Matsuo, H Ohsaki 2022 International Conference on Information Networking (ICOIN), 232-237, 2022 | 2 | 2022 |
| A Solution of Minimum Link Flow Problem with Sparse Modeling--Formulation and Preliminary Results R Matsuo, R Nakamura, H Ohsaki IEICE Technical Report; IEICE Tech. Rep. 117 (299), 23-26, 2017 | 2 | 2017 |
| On the effect of communication link heterogeneity on content delivery delay in information-centric delay tolerant networks H Sagayama, R Matsuo, H Ohsaki 2022 IEEE 46th Annual Computers, Software, and Applications Conference …, 2022 | 1 | 2022 |
| A study on the relation between shortest path lengths of original and coarsened graphs T IWATA, K KITAURA, R MATSUO, H OHSAKI IEICE Proceedings Series 63 (N1-5), 2020 | 1 | 2020 |
| On estimating network topology from observed flow sets at measurement nodes K Kitaura, M Ryotaro, N Ryo, O Hiroyuki 2020 IEEE 44th Annual Computers, Software, and Applications Conference …, 2020 | 1 | 2020 |
| A solution for minimum link flow problem with sparse modeling R Matsuo, R Nakamura, H Ohsaki 2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC …, 2018 | 1 | 2018 |
| On the separability of aggregated multilayer networks R Matsuo, R Wang, H Ohsaki IEICE Communications Express 12 (2), 54-59, 2023 | | 2023 |
| On the mean first passage time and mean cover time of a non-backtracking random walk on graphs R Matsuo, T Kawagishi, H Ohsaki IEICE Communications Express 12 (1), 42-47, 2023 | | 2023 |
| On improving the properties of random walk on graph using Q-learning R Matsuo, T Miyashita, T Suzuki, H Ohsaki IEICE Communications Express 12 (1), 36-41, 2023 | | 2023 |
| A Study on a Co-Ranking Algorithm of Layers and Nodes for Multilayer Networks S Shirakawa, HI Sawano, R Matsuo, H Ohsaki IEICE Proceedings Series 72 (S5-5), 2022 | | 2022 |
| A Study on the Exploration Efficiency of (α, k) Random Walk on Unknown Graphs R Yoshitsugu, T Iwata, R Matsuo, H Ohsaki IEICE Proceedings Series 72 (S5-2), 2022 | | 2022 |
| Effect of Laziness of Random Walks on the Efficiency of Graph Exploration in Dynamic Graphs D Nakagawa, T Iwata, R Matsuo, H Ohsaki IEICE Proceedings Series 72 (S5-3), 2022 | | 2022 |
| Message Delivery Delay with End-to-End Routing in Complex Networks Y Hatanaka, H Sawano, R Matsuo, H Ohsaki IEICE Proceedings Series 72 (S2-7), 2022 | | 2022 |
| A Study on Node Centrality Obfuscation in Large-Scale Networks H Kawamura, T Iwata, R Matsuo, H Ohsaki IEICE Proceedings Series 72 (S5-4), 2022 | | 2022 |
| A Solution for Finding Quasi-Shortest Path with Graph Coarsening T Iwata, K Kitaura, R Matsuo, H Ohsaki 2022 International Conference on Information Networking (ICOIN), 215-219, 2022 | | 2022 |
| On Accelerating Multiple Random Walks with Loose Cooperation J Hagikura, R Matsuo, H Ohsaki 2022 International Conference on Information Networking (ICOIN), 238-243, 2022 | | 2022 |
| グラフ上の不可逆ランダムウォークの初回到着時間および被覆時間に関する一検討 河岸哲哉， 萩倉丈， 松尾涼太郎， 大崎博之 電子情報通信学会技術研究報告; 信学技報 121 (300), 56-59, 2021 | | 2021 |
| Study on the Separability of Aggregated Multilayer Networks R Wang, Y Wakisaka, R Matsuo, H Ohsaki IEICE Technical Report; IEICE Tech. Rep. 121 (300), 60-62, 2021 | | 2021 |
Hiroyuki OhsakiSchool of Engineering, Kwansei Gakuin University, JapanVerified email at kwansei.ac.jp
