IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 58  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IN, IA
(Joint)
2022-12-13
10:40
Hiroshima Higashi-Senda campus, Hiroshima Univ.
(Primary: On-site, Secondary: Online)
A Study on Effect of Laziness of Random Walk on Efficiency of Graph Exploration in Dynamic Graphs
Daiki Nakagawa, Takeaki Iwata, Ryotaro Matsuo, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-57
(To be available after the conference date) [more] IA2022-57
pp.50-55
IN, IA
(Joint)
2022-12-13
11:30
Hiroshima Higashi-Senda campus, Hiroshima Univ.
(Primary: On-site, Secondary: Online)
[Short Paper] For Understanding the First Meeting Time of Multiple Random Walks with Different Transition Probabilities
Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Osaki (Kwansei Gakuin Univ.) IA2022-59
(To be available after the conference date) [more] IA2022-59
pp.60-63
IN, IA
(Joint)
2022-12-13
11:45
Hiroshima Higashi-Senda campus, Hiroshima Univ.
(Primary: On-site, Secondary: Online)
[Short Paper] On the Study of the Effectiveness of the Random Walk-Based Rendezvous for Real Social Networks
Toma Yoshinari, Nanami Tsuji, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2022-60
(To be available after the conference date) [more] IA2022-60
pp.64-66
IN, CCS
(Joint)
2022-08-05
09:00
Hokkaido Hokkaido University(Centennial Hall)
(Primary: On-site, Secondary: Online)
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing
Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] IN2022-18
pp.15-20
CCS, NLP 2022-06-10
14:25
Osaka
(Primary: On-site, Secondary: Online)
The skeletal structure of transition probabilities on quantum-walk-replicating random walks
Tomoki Yamagami (UTokyo), Etsuo Segawa (YNU), Ken'ichiro Tanaka, Takatomo Mihana, Andre Roehm, Ryoichi Horisaki, Makoto Naruse (UTokyo) NLP2022-19 CCS2022-19
In this report, we analyze the transition probabilities of random walk replicating the probability distribution of quant... [more] NLP2022-19 CCS2022-19
pp.94-99
NS, IN
(Joint)
2022-03-11
14:20
Online Online A Method for Generating Random Walk Paths Focusing Only on Updates Near A Source Node in Dynamic Distributed Graphs
Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-48
In graph calculations with a lot of random walks (RWs), some long RWs become bottlenecks, and thus pre-execution of RWs ... [more] IN2021-48
pp.103-108
CQ, CBE
(Joint)
2022-01-27
16:55
Ishikawa Kanazawa(Ishikawa Pref.)
(Primary: On-site, Secondary: Online)
An experimental study to clarify the characteristics of multiple random walks with different transition probabilities
Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-85
Random walks on graphs have been used in various graph algorithms. The first meeting time is defined by the time it take... [more] CQ2021-85
pp.50-55
CQ, CBE
(Joint)
2022-01-28
11:45
Ishikawa Kanazawa(Ishikawa Pref.)
(Primary: On-site, Secondary: Online)
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks
Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ) CQ2021-92
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] CQ2021-92
pp.88-93
NS, NWS
(Joint)
2022-01-28
10:50
Online Online [Encouragement Talk] Degree Based Vertex Replication Method for Random Walk in Autonomous Distributed Graphs
Ozaki Yoichi, Kaneko Kunitake (Keio Univ.) NS2021-116
In autonomously distributed graphs, the vertex set placed on a server does not always follow the community structure of ... [more] NS2021-116
pp.36-41
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
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
CAS, NLP 2021-10-15
10:00
Online Online A Binary Discrete-Time Model-Based Discussion on the Quantum Counterpart of Electric Circuits
Hisato Fujisaka (Hiroshima City Univ.) CAS2021-30 NLP2021-28
Electric networks consisting of LCR elements are dissipative wave systems while quantum energy-conservative systems are ... [more] CAS2021-30 NLP2021-28
pp.74-77
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 2021-09-08
10:55
Online Online Analysis of Diverse Random Walks with Different Transition Probabilities and Different Moving Frequencies Using Spectral Graph Theory
Nanami Tsuji, Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2021-17
The first meeting time is defined by the time it takes for multiple mobile agents starting random walks from different n... [more] IA2021-17
pp.14-21
RCS, IN, NV
(Joint)
2021-05-28
11:45
Online Online An Evaluation of Tracking Performance of Personalized PageRank Using Random Walk in Dynamic Graphs
Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-5
By combining graphs managed by multiple services, we can create an autonomous distributed graph that enables multiple se... [more] IN2021-5
pp.25-30
NS 2021-05-13
14:50
Online Online Evaluation of the effect of vertex replication for random walk in autonomous distributed graphs
Yoichi Ozaki, Kunitake Kaneko (Keio Univ.) NS2021-19
It is important to obtain a subgraph from a distributed graph by Random Walk while maintaining the rough structure of th... [more] NS2021-19
pp.26-31
NS 2021-05-13
15:15
Online Online Graph Reordering while Acquiring Graph Data Managed Distributedly by Random Walk
Kohei Tsuchida, Kunitake Kaneko (Keio Univ.) NS2021-20
It is known that cache misses occur so many times, which leads to slow down the calculation speed while graph processing... [more] NS2021-20
pp.32-37
CS, CQ
(Joint)
2021-05-14
10:50
Online On-line A Study of the Effect of Agents' Diversities on the Running Time of the Random Walk-Based Rendezvous Search
Fumiya Toyoda, Yusuke Sakumoto (Kwansei Univ.) CQ2021-13
A rendezvous search, which aims to efficiently meet multiple searchers existing different nodes on a network, is expecte... [more] CQ2021-13
pp.53-58
IN 2021-01-18
10:30
Online Online Local community and weak ties detection using random walk on hypergraph.
Ryo Oka (Keio Univ.), Yuuki Takai (RIKEN), Naoki Matsumoto (Keio Univ.), Masahiro Ikeda (RIKEN), Kunitake Kaneko (Keio Univ.) IN2020-41
There are many services that use a graph with a content as a vertex and their relationship as a edge. Community detectio... [more] IN2020-41
pp.1-6
CQ 2020-09-03
11:45
Osaka Osaka University Nakanoshima Center
(Primary: On-site, Secondary: Online)
Study on the Effectivity of Rendezvous Search Using Random Walk in Large-Scale Unknown Networks
Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Univ.) CQ2020-37
Many studies proposed a rendezvous search method that multiple searchers starting from different nodes on a network try ... [more] CQ2020-37
pp.15-20
 Results 1 - 20 of 58  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan