| 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 # | |
| NLP, MSS | 2024-03-14 11:15 |
Misc. | Kikai-Shinko-Kaikan Bldg. | Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] | MSS2023-89 NLP2023-141 pp.87-92 |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| COMP | 2015-12-01 10:30 |
Osaka | A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] | COMP2015-31 pp.9-16 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 15:35 |
Oita | B-ConPlaza | Parallelization of Shortest Path Search on Various Platforms and Its Evaluation Shuto Kurebayashi, Shinya Takamaeda, Jun Yao, Yasuhiko Nakashima (NAIST) CPSY2014-74 |
Since graph processing has irregular control flows and memory access patterns, its acceleration by the parallelization i... [more] | CPSY2014-74 pp.13-18 |
| RECONF | 2014-06-12 16:25 |
Miyagi | Katahira Sakura Hall | Design of an FPGA-Based Accelerator for Shortest-Path Search over Large-Scale Graphs Yasuhiro Takei, Masanori Hariyama, Michitaka Kameyama (Tohoku Univ.) RECONF2014-15 |
Shortest-path search over large scale graphs plays an important role in various applications. However, shortest path alg... [more] | RECONF2014-15 pp.79-83 |
| WIT | 2011-05-21 14:30 |
Niigata | Niigata Univ. | Development of a Route Guidance System for Blind Pedestrians George Akiyama, Tetsuya Watanabe, Ken Watanabe, Toshimitsu Yamaguchi (Niigata Univ.), Kazunori Minatani (DNC), Manabi Miyagi (Tsukuba Univ. Tech.), Susumu Oouchi (NISE) WIT2011-18 |
We developed a route guidance automatic creating system to help blind people know their route by speech. The route guida... [more] | WIT2011-18 pp.97-100 |
| 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 |
| HCGSYMPO (2nd) |
2010-12-15 - 2010-12-17 |
Miyazaki | Miyazaki Seagai resort | Basic Investigation of Indoor Navigation using Ultrasonic Positioning System Naoki Aikawa, Hikaru Sunaga, Hitoki Komatsu, Masaki Akiyama, Shigenori Ioroi, Hiroshi Tanaka (KAIT) |
The navigation system is widely used in the field of car navigation and GPS embedded cell phones. However, the navigatio... [more] | |
| 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 |
| RECONF | 2005-12-01 09:30 |
Fukuoka | Kitakyushu International Conference Center | A Study on Shortest Path Routing Algorithm on Reconfigurable Processor Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka (Keio Univ.), Kosuke Shiba (IPFlex) |
n IP networks, we ordinally use OSPF(Open Shortest Path First) as a routing protocol. OSPF find the shortest path using ... [more] | RECONF2005-59 pp.1-6 |
| PRMU, NLC | 2005-02-24 16:10 |
Tokyo | Realtime Human Action Recognition using High Speed Calculation of Subgraph Similarity in Feature Space Hiroki Shimono, Masami Satou, Hitoshi Kitazawa (TUAT) |
An extension of human action detection by the similarity of subgraphs which represent action templates and measurement i... [more] | NLC2004-115 PRMU2004-197 pp.109-114 |
|
[Return to Top Page]