| 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 # | |
| IA, SITE, IPSJ-IOT [detail] | 2024-03-12 10:45 |
Okinawa | Miyakojima City Future Creation Center (Primary: On-site, Secondary: Online) |
Comparison of Spanning Trees by Applying Plumtree to a Disaster Notification Wireless Mesh Network to Shortest Path Trees Tomoki Okuda (Kogakuin Univ), Masaaki Ohnishi (NOHMI BOSAI), Ryohei Banno (Kogakuin Univ)  SITE2023-69 IA2023-75 |
In the event of a national disaster such as a huge Nanlai Trough earthquake, large-scale communication failures are expe... [more] | SITE2023-69 IA2023-75 pp.7-11 |
| CAS, MSS, IPSJ-AL [detail] | 2019-11-28 13:50 |
Fukuoka | The expected distance sum of random shortest-path in-trees over Hamilton path trajectory on grid graph Yoshihiro Kaneko (Gifu Univ.) CAS2019-50 MSS2019-29 |
The paper deals with shortest path-based in-trees on a grid graph. There root moves among all vertices. As such root mob... [more] | CAS2019-50 MSS2019-29 pp.33-38 |
|
| 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 |
| NS, IN (Joint) |
2017-03-03 15:30 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL | Selection Algorithm of Links to Aggregate Traffic for Network Greening with considering Transmission Performance Atsushi Yorichika, Kenji Kawahara (KIT) IN2016-162 |
As the Internet grows explosively and network components such as routers and switches increase, they consume electric po... [more] | IN2016-162 pp.389-394 |
| IN | 2015-01-23 16:10 |
Aichi | Nagoya International Center | Link Selection Scheme based on Shortest Path Trees from Exporter Routers with considering Traffic Fluctuation for Network Greening Tomohiro Sakamoto, Kenji Kawahara, Yuji Oie (KIT) IN2014-117 |
As the Internet grows explosively and network components such as routers and switches increase,they consume electric pow... [more] | IN2014-117 pp.113-118 |
| NS | 2013-04-19 14:20 |
Ishikawa | The Wajima Chamber of Commerce and Industry | Optimal Multiple Shared Multicast Trees for Many-to-Many Multicasting Communication Shanming Zhang, Hidetoshi Takeshita (Keio Univ.), Takashi Kurimoto (NTT), Satoru Okamoto, Naoaki Yamanaka (Keio Univ.) NS2013-10 |
Multicast, which provides an efficient way of disseminating data from a source to all the members in a multicast group, ... [more] | NS2013-10 pp.49-54 |
| IN | 2013-01-25 13:30 |
Kagoshima | Kagoshima-Ken-Sangyo-Kaikan | Exporter Router and Transmission Path Selection Scheme in Routing on Shortest Path Trees for Network Greening Kazuki Kawamoto (KIT), Hitomi Tamura (FIT), Kenji Kawahara, Yuji Oie (KIT) IN2012-149 |
As the Internet grows explosively, power consumption of network components is also increasing, thus network greening bec... [more] | IN2012-149 pp.63-68 |
| COMP | 2011-03-09 13:00 |
Tokyo | Chuo Univ. | New k shortest simple path algorithm that reduces the average case time complexity Hiroshi Matsuura (NTT) COMP2010-49 |
The author proposed k-SPF-plus algorithm that realizes to shorten the worst case time complexity for creating k shortest... [more] | COMP2010-49 pp.17-24 |
| IN | 2010-12-17 10:25 |
Hiroshima | Hiroshima City Univ. | A proposal of k shortest simple path algorithm to minimize computational complexity Hiroshi Matsuura (NTT) IN2010-107 |
k shortest path algorithm is expected to be applied to creating replacement paths and traffic dispersion by using multip... [more] | IN2010-107 pp.57-62 |
| COMP | 2010-10-15 10:05 |
Miyagi | Tohoku Univ. | Constant-Work-Space Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-32 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] | COMP2010-32 pp.9-15 |
| NS, IN (Joint) |
2010-03-04 09:20 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | Random Walk Search for Unstructured Peer-to-Peer Overlays Using Hop-Limited Shortest Path Trees Phouvieng Hieungmany, Shigeo Shioda (Chiba Univ.) IN2009-164 |
We propose an efficient random-walk-based file search on unstructured P2P networks. In the proposal, each node keeps tw... [more] | IN2009-164 pp.121-126 |
| CAS | 2008-02-01 10:55 |
Okinawa | A Fast Modification Algorithm for Shortest Path Tree and its Performance Evaluation Tsutomu Ishida, Yukihide Kohira, Atsushi Takahashi (Tokyo Tech) CAS2007-98 |
In VLSI design, circuits are improved by circuit modifications.The minimum feasible clock period of a circuit is one of ... [more] | CAS2007-98 pp.25-30 |
|
| NS, IN (Joint) |
2007-03-09 14:10 |
Okinawa | Okinawa Convention Center | Performance Evaluation of Ad hoc Multicast Routing Protocol Constructing Shortest Path Tree with One Way Control Message Flow Tsutomu Kozaka, Toshihiko Kato, Shuichi Itoh (UEC), Yoshiyori Urano (Waseda Univ.) NS2006-218 |
In recent years, ad hoc networks become widely used, and the multicasting type services, such as video/voice streaming a... [more] | NS2006-218 pp.311-316 |
| PN, IN (Joint) |
2005-10-14 16:10 |
Kanagawa | Keio Univ. (Yagami) | Efficient Flooding Technique Based on Partial Shortest-Path Trees Constructed in a Distributed Fashion Kenji Ohtsuka, Shigeo Shioda (Chiba Univ.) |
In this paper, we propose an efficient-message-flooding technique for computer networks. The key idea of our proposal i... [more] | IN2005-97 pp.55-60 |
| NS, RCS (Joint) |
2005-07-21 14:00 |
Okayama | Okayama Univ.(Tsushima Campus) | Design of Ad hoc Multicast Routing Protocol Using Shortest Path Trees Tsutomu Kozaka, Toshihiko Kato, Shuichi Itoh (UEC), Yoshiyori Urano (Waseda Univ.) |
In recent years, an ad hoc network is paid to attention, and many routing protocols are studied actively not only for un... [more] | NS2005-64 pp.13-16 |
[Return to Top Page]