| 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 # | |
| 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 |
| IN, CCS (Joint) |
2020-08-04 14:55 |
Online | Online | Landmark Decision Method Combining Random Walk and Betweenness Centrality Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2020-19 |
Abstract Highly reproducible presentations of important nodes near the node of interest are useful in determin- ing land... [more] | IN2020-19 pp.59-64 |
| NS, NWS (Joint) |
2020-01-24 14:50 |
Okinawa | [Encouragement Talk]
Load balancing scheme considering flow types in Data Center Network Takuna Kaiwa (UEC), Takashi Naito (NII), Nattapong Kitsuwan (UEC) NS2019-172 |
A scheme to resolve an imbalanced state in a data center network by adopting a dynamic link weight based on betweenness ... [more] | NS2019-172 pp.67-72 |
|
| NS | 2019-10-10 10:45 |
Aichi | Nagoya Institute of Technology | Load balancing scheme considering flow types in software-defined network Takuna Kaiwa (UEC), Takashi Naito (NII), Nattapong Kitsuwan (UEC) NS2019-99 |
A scheme to resolve an imbalanced state in a data center network by adopting a dynamic link weight based on betweenness ... [more] | NS2019-99 pp.1-6 |
| 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 |
| COMP | 2018-03-05 15:30 |
Osaka | Osaka Prefecture Univ. | Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) COMP2017-51 |
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] | COMP2017-51 pp.35-42 |
| NS | 2017-10-27 10:45 |
Osaka | I-site nanba | Betweenness Computation using Graph Compression Kazuharu Aramaki, Nattapong Kitsuwan (UEC), Eiji Oki (Kyoto-u) NS2017-108 |
Computation method for the betweenness centrality of every vertex in a graph is proposed in this paper. The proposed met... [more] | NS2017-108 pp.83-87 |
| NLP | 2016-09-15 11:05 |
Hyogo | Konan Univ. | A Fast Method for Finding the Edge to be Inserted to Minimize Betweenness Centrality of a Specified Vertex Toshiyuki Namba, Tatsuki Kohno, Norikazu Takahashi (Okayama Univ.) NLP2016-56 |
Betweenness centrality is a measure that represents the importance of each vertex of a graph. From the viewpoint of the ... [more] | NLP2016-56 pp.63-68 |
| VLD, CAS, MSS, SIP | 2016-06-17 11:40 |
Aomori | Hirosaki Shiritsu Kanko-kan | A weighted graph representation for new joint of technical committee conferences Yoshihiro Kaneko, Katsuaki Nakajima (Gifu Univ.) CAS2016-24 VLD2016-30 SIP2016-58 MSS2016-24 |
(To be available after the conference date) [more] | CAS2016-24 VLD2016-30 SIP2016-58 MSS2016-24 pp.129-132 |
| NS, IN (Joint) |
2014-03-07 10:20 |
Miyazaki | Miyazaki Seagia | A New Load Balancing Scheme by Using Modified Betweenness Centralities in WDM Networks with Wavelength Converters Yutaro Nagata, Koichi Asatani, Hiroyuki Otsuka (Kogakuin Univ.) IN2013-163 |
In WDM networks, a node requests an optical path, selects a wavelength along with a candidate route, and establishes an... [more] | IN2013-163 pp.117-122 |
| NS, IN (Joint) |
2014-03-07 11:20 |
Miyazaki | Miyazaki Seagia | Estimation of Betweenness Centrality in terms of Links for Inferring Network Performance Takeshi Kondo, Kenji Kawahara (Kyushu Inst. of Tech.) IN2013-166 |
The cost for measurement and prediction of the network performance such as packet loss and utilization on some links bec... [more] | IN2013-166 pp.133-138 |
| AI, JSAI-DOCMAS, JSAI-KBS, JSAI-SAI, IPSJ-ICS | 2014-03-03 16:20 |
Hokkaido | Hotel Kanronomori | Strategy of Hex using betweenness centrality in board network Kei Takada, Masaya Honjo, Hiroyuki Iizuka, Masahito Yamamoto (Hokkaido Univ.) AI2013-46 |
Hex is a simple board game for two players, but the game strategy becomes very complicated. It is known that all positi... [more] |
AI2013-46 pp.7-12 |
| IN, IA (Joint) |
2013-12-19 11:10 |
Hiroshima | Hiroshima City Univ. | A New Load-Balancing Scheme by Using Betweenness Centrality Applied to Scale-Free Networks Soma Hayashi, Yutaro Nagata, Koichi Asatani (Kogakuin Univ.) IN2013-100 |
The Internet is a scale-free network, where node degree distribution follows a power law. In a scale-free network, OSPF ... [more] | IN2013-100 pp.7-12 |
| IN | 2013-01-25 10:50 |
Kagoshima | Kagoshima-Ken-Sangyo-Kaikan | A Proposal of a New Node Centrality Index about Routing in MANET Kotomi Nakajima, Masaki Aida (Tokyo Metropolitan Univ) IN2012-145 |
Betweenness centrality is known as a index of node's importance, and it is applicable to communication networks in which... [more] | IN2012-145 pp.39-44 |
| CQ, ICM, NS (Joint) |
2012-11-16 11:30 |
Shiga | Nagahama Inst. of Bio-Science and Tech. | On Finding Potential Investment Sites on WDM Equipments with Betweenness Centrality Masaaki Miyashita, Norihiko Shinomiya (Soka Univ.), Takuya Miyashita (Fujitsu), Kazuyuki Tajima, Takao Naito (Fujitsu Lab.) ICM2012-36 |
On WDM optical networks, the explosive growth of traffic could require the reinforcement of the equipment investment in ... [more] | ICM2012-36 pp.41-44 |
| IN | 2012-01-26 14:55 |
Hokkaido | Asahikawa-Terminal-Hotel | On the Robustness of Centrality Measures against Link Weight Quantization in Social Network Analysis Yukihiro Matsumoto, Sho Tsugawa, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ) IN2011-124 |
Researches on social network analyses have been actively performed. In social network analysis, individuals are repres... [more] |
IN2011-124 pp.23-28 |
| SITE | 2008-12-05 13:00 |
Tokyo | Information Network Design using Social Network Analysis Results
-- Fast Algorithm for Between Centrality -- Shun-ichi Kurino (Nihon Univ.), Toshio Takahashi (Employment and Human Resources Development Organization of Japan), Noriaki Yoshikai (Nihon Univ.) SITE2008-36 |
Traditionally. the information network (IN) and the social network (SN) have been researched separately as the independ... [more] |
SITE2008-36 pp.1-5 |
|
[Return to Top Page]