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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 68  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IBISML 2022-09-15
15:30
Kanagawa Keio Univ. (Yagami Campus)
(Primary: On-site, Secondary: Online)
An Genenalized LiNGAM when confunder is present -- A formulation of ICA and the minimum shortest problem --
Joe Suzuki, Tianle Yang (Osaka U.) IBISML2022-39
In this study, we investigated a generalization of LiNGAM that allows the presence of confounding. Existing LiNGAMs assu... [more] IBISML2022-39
pp.47-54
CAS, SIP, VLD, MSS 2022-06-17
13:00
Aomori Hachinohe Institute of Technology
(Primary: On-site, Secondary: Online)
A revised shortest path-based routing in WSN model
Yoshihiro Kaneko (Gifu Univ.), Mayu Okumura (Meitec) CAS2022-12 VLD2022-12 SIP2022-43 MSS2022-12
In this report, we deal with a shortest path-based routing, termed as an SP-routing, for a longer lifetime on a wireless... [more] CAS2022-12 VLD2022-12 SIP2022-43 MSS2022-12
pp.61-66
CCS, NLP 2022-06-09
17:40
Osaka
(Primary: On-site, Secondary: Online)
Speeding up an algorithm for searching generalized Moore graphs
Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2022-11 CCS2022-11
Computer networks in data centers are modeled as undirected regular graphs, and the average shortest path length (ASPL) ... [more] NLP2022-11 CCS2022-11
pp.52-57
NS 2022-04-15
11:10
Tokyo kikai shinkou kaikan + online
(Primary: On-site, Secondary: Online)
Service Chaining Based on Capacitated Shortest Path Tour Problem -- Solution Based on Deep Reinforcement Learning and Graph Neural Network --
Takanori Hara, Masahiro Sasabe (NAIST) NS2022-2
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] NS2022-2
pp.7-12
MSS, CAS, IPSJ-AL [detail] 2021-11-18
10:55
Online Online Shortest cycles on a WRSN model provided by a WSN routing
Yoshihiro Kaneko, Keisuke Murase (Gifu Univ.) CAS2021-41 MSS2021-21
For a wireless sensor network WSN and its related models, we have so far considered routings, sink trajectories and so o... [more] CAS2021-41 MSS2021-21
pp.24-27
IN, NS, CS, NV
(Joint)
2021-09-09
12:40
Online Online Service Chaining Based on Capacitated Shortest Path Tour Problem -- Solution Based on Lagrangian Relaxation and Shortest Path Tour Algorithm --
Takanori Hara, Masahiro Sasabe (NAIST) NS2021-60
Network functions virtualization (NFV) can speedily and flexibly deploy network services by replacing traditional networ... [more] NS2021-60
pp.18-23
CS 2020-11-06
10:00
Online Online + Central Community Center, Nonoichi Community Center
(Primary: Online, Secondary: On-site)
ACO-based shortest hop routing algorithm
Guan Xin, Hidenori Nakazato (Waseda Univ) CS2020-56
ACO (Ant Colony Optimization) routing algorithm is an effective routing algorithm. However, this algorithm has some shor... [more] CS2020-56
pp.48-53
IA 2020-10-01
16:25
Online Online [Poster Presentation] A Study on Topology Estimation from Observed Network Flows
Keita Kitaura, Ryotaro Matsuo (Kwansei Gakuin Univ.), Ryo Nakamura (Fukuoka Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA2020-11
Acquisition and estimation of topologies of large-scale evolving networks
such as communication networks and social net... [more]
IA2020-11
p.31
NLP 2020-05-15
13:00
Online Online A Genetic Algorithm for Minimizing Average Shortest Path Length of Regular Graphs
Reiji Hayashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-3
For the problem of finding a regular graph with given order and degree that minimizes the average shortest path length, ... [more] NLP2020-3
pp.11-16
NS, IN
(Joint)
2020-03-05
11:00
Okinawa Royal Hotel Okinawa Zanpa-Misaki
(Cancelled but technical report was issued)
Sequential Calculation of Dynamic User Equilibrium for Network Controlled Autonomous Driving
Ryo Onoda, Goki Yamamoto, Hiroki Kubokawa, Masaki Murakami, Naoaki Yamanaka, Satoru Okamoto (Keio Univ.) NS2019-194
Traffic congestion is a major problem in the automotive society. Because of the spread of autonomous driving vehicles an... [more] NS2019-194
pp.101-106
IE, IMQ, MVE, CQ
(Joint) [detail]
2020-03-06
09:45
Fukuoka Kyushu Institute of Technology
(Cancelled but technical report was issued)
Pose-based Shot Detection in a Badminton Doubles Competition Video
Satoru Yamagishi, Yoshiteru Yamamoto, Keisuke Doman, Yoshito Mekada (Chukyo Univ.) IMQ2019-54 IE2019-136 MVE2019-75
The movement in formation of players is a key factor to score a point in badminton doubles competition.
It is, however,... [more]
IMQ2019-54 IE2019-136 MVE2019-75
pp.199-203
COMP 2019-12-13
17:00
Gunma Ikaho Seminar House, Gunma University COMP2019-42 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] COMP2019-42
pp.93-100
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
NLP, CCS 2018-06-10
11:20
Kyoto Kyoto Terrsa Some Efficient Methods for Searching Generalized Moore Graphs
Yoshiki Satotani, Norikazu Takahashi (Okayama Univ.) NLP2018-43 CCS2018-16
Computer networks used for high performance computing are often modeled by undirected regular graphs, and the average sh... [more] NLP2018-43 CCS2018-16
pp.85-90
MBE, NC, NLP
(Joint)
2018-01-26
13:25
Fukuoka Kyushu Institute of Technology Methods for Constructing Simple Undirected Regular Graphs Based on Generalized de Bruijn Graphs
Ryoya Ishii, Norikazu Takahashi (Okayama Univ.) NLP2017-90
The Generalized de Bruijn Graphs (GDBG) are a class of directed regular graphs. Since the average shortest path length o... [more] NLP2017-90
pp.23-28
CNR, IN, MoNA
(Joint) [detail]
2017-11-16
10:50
Fukuoka   Coverage Expansion of Vehicular Millimeter Wave Communication with Multi-hop Relaying
Akihito Taya, Takayuki Nishio, Masahiro Morikura, Koji Yamamoto (Kyoto Univ.) MoNA2017-17
A small road side unit (RSU) coverage of millimeter wave (mmWave) communications for autonomous vehicles is an open issu... [more] MoNA2017-17
pp.13-18
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
NS, IN
(Joint)
2017-03-03
13:20
Okinawa OKINAWA ZANPAMISAKI ROYAL HOTEL On Path Selection Considering Length and Reliability for Automatic Evacuation Guiding Based on Interactions between Evacuees and Their Mobile Nodes
Takanori Hara, Masahiro Sasabe, Shoji Kasahara (NAIST) NS2016-247
When disasters occur, evacuees have to evacuate to safe place quickly. To tackle this problem, there has been proposed a... [more] NS2016-247
pp.517-522
COMP, ISEC 2016-12-21
15:30
Hiroshima Hiroshima University Theoretical Model of Interconnection Networks Consisting of Hosts and Switches
Ryota Yasudo (Keio Univ.), Michihiro Koibuchi (NII), Hideharu Amano (Keio Univ.), Koji Nakano (Hiroshima Univ.) ISEC2016-79 COMP2016-40
Designing interconnection networks with low average shortest path length (ASPL) is an important object for researchers o... [more] ISEC2016-79 COMP2016-40
pp.51-58
 Results 1 - 20 of 68  /  [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