| 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 # | |
| CPSY, IPSJ-ARC, IPSJ-HPC | 2023-12-06 10:30 |
Okinawa | Okinawa Industry Support Center (Primary: On-site, Secondary: Online) |
Development of Genetic Algorithm for Grid Graph in Order/Degree Problem Kimura Hiroto, Yoshiko Hanada (Kansai Univ.), Masahiro Nakao, Keiji Yamamoto (R-CCS)  CPSY2023-32 |
We propose a genetic algorithm for solving grid graph that is a kind of Order/Degree problems (ODP). Grid graph is an op... [more] | CPSY2023-32 pp.31-35 |
| SeMI, IPSJ-DPS, IPSJ-MBL, IPSJ-ITS | 2022-05-26 12:27 |
Okinawa | (Primary: On-site, Secondary: Online) |
Matrix Connection for Renewable Energy Oriented Self-Sustaining Decentralized Grid Graph generation method for maximum flow derivation Takumi Wada (Kanagawa Institute of Technology), Haruhisa Ichikawa, Shinji Yokogawa (The Univ of Electro-Communications), Yoshito Tobe (Aoyama Gakuin Univ), Yuusuke Kawakita (Kanagawa Institute of Technology) SeMI2022-3 |
As attention focuses on independent and decentralized energy utilization oriented toward renewable energy, small-scale g... [more] | SeMI2022-3 pp.11-14 |
| COMP | 2021-03-08 09:45 |
Online | Online | On an Algorithm for minimizing the number of routers in Grid Networks among Three Points Yusuke Sawada, Yonghwan Kim, Yoshiaki Katayama (Nitech) COMP2020-28 |
In this paper, we consider a route optimizing problem in grid networks. A grid network is an overlay-network which can b... [more] | COMP2020-28 pp.1-8 |
| 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 |
|
| ISEC, COMP | 2017-12-21 11:25 |
Kochi | Eikokuji Campus, Kochi University of Technology | O(n^{1/3})-space algorithm for the grid graph reachability problem Ryo Ashida, Kotaro Nakagawa (Tokyo Tech) ISEC2017-75 COMP2017-29 |
The directed graph reachability problem is a canonical complete problem for class NL. The best known polynomial time al... [more] |
ISEC2017-75 COMP2017-29 pp.19-24 |
| CAS, MSS, IPSJ-AL [detail] | 2017-11-16 11:20 |
Tokyo | [Invited Talk]
On the Recognition of Unit Grid Intersection Graphs Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2017-44 MSS2017-28 |
We show that the recognition problem for unit grid intersection graphs is NP-complete. [more] | CAS2017-44 MSS2017-28 pp.15-20 |
|
| CAS, MSS, IPSJ-AL [detail] | 2017-11-16 15:40 |
Tokyo | The stable transmission tree and minimum cost transmission tree on wireless sensor network with mobile sink along the boundary Yoshihiro Kaneko, Tsubasa Yamada, Takuya Tsujimoto (Gifu Univ.) CAS2017-47 MSS2017-31 |
In wireless sensor network WSN, data are collected and transmitted toward one node called a sink, if necessary, in a mul... [more] | CAS2017-47 MSS2017-31 pp.45-50 |
|
| MSS, CAS, IPSJ-AL [detail] | 2016-11-24 10:25 |
Hyogo | Kobe Institute of Computing | The shortest twice flight routes of UAV on square grid graph with inside depot Yoshihiro Kaneko, Kani (Gifu Univ.), Mase Kennichi (Niigata Univ.) CAS2016-59 MSS2016-39 |
(To be available after the conference date) [more] | CAS2016-59 MSS2016-39 pp.7-12 |
| VLD | 2015-03-02 13:00 |
Okinawa | Okinawa Seinen Kaikan | A Fast Lithographic Mask Correction Algorithm Ahmd Awad, Atsushi Takahashi (Tokyo Institute of Technology) VLD2014-153 |
As technology nodes downscaling into sub-16 nm regime, the industry relies heavily on Optical Proximity Correction (OP... [more] |
VLD2014-153 pp.1-6 |
| HCS, HIP, HI-SIGCOASTER [detail] | 2014-05-30 16:40 |
Okinawa | Okinawa Industry Support Center | EEG features of recognizing facial expressions Masahiro Yasuda, Zhang Dou, Minoru Nakayama (Tokyo Inst. of Tech.) HCS2014-41 HIP2014-41 |
We investigated the relationship between the electroencephalogram (EEG) reaction to facial photographs which showed emot... [more] | HCS2014-41 HIP2014-41 pp.307-312 |
| COMP | 2014-03-10 15:05 |
Tokyo | Safely-converging self-organization of a BFS tree with many leaves in virtual grid networks Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2013-70 |
We propose a safely-converging self-organization of a Breadth-First-Search spanning tree (BFS tree) with many leaves in ... [more] | COMP2013-70 pp.69-76 |
|
| CAS | 2014-02-07 11:20 |
Kanagawa | Nippon Maru Training center | On Finding Optimal Routes to Minimize Transmission Loss in Power Grid Yasuo Ogura, Norihiko Shinomiya (Soka Univ.) CAS2013-85 |
The dependence on the nuclear power generation in Japan has been reduced since the Great East Japan Earthquake occurred.... [more] | CAS2013-85 pp.63-65 |
| IN, NV (Joint) |
2013-07-18 15:40 |
Hokkaido | Hokkaido Univ. Faculty of Eng. Academic Lounge 3 | [Invited Talk]
Fast Algorithms for Counting the Number of Paths in a Grid Graph Hiroaki Iwashita (JST) IN2013-44 |
A path in a graph, which is also referred to as a self-avoiding walk (SAW), is a way to go from a vertex to another vert... [more] | IN2013-44 pp.49-54 |
| SIP, CAS, MSS, VLD | 2013-07-12 15:00 |
Kumamoto | Kumamoto Univ. | On Unit Grid Intersection Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31 |
This paper shows that the recognition problem for unit grid intersection graphs is NP-complete. We also show that any gr... [more] | CAS2013-31 VLD2013-41 SIP2013-61 MSS2013-31 pp.171-175 |
| VLD, CAS, MSS, SIP | 2012-07-03 09:50 |
Kyoto | Kyoto Research Park | On Minimum Feedback Vertex Sets in Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16 |
For the minimum feedback vertex set problem, we show a linear time algorithm for bipartite permutation graphs, the NP-ha... [more] | CAS2012-16 VLD2012-26 SIP2012-48 MSS2012-16 pp.87-92 |
| COMP | 2012-03-16 14:10 |
Tokyo | Univ. of Tokyo | Sublinear Space Algorithm for Shortest Path Problem on Grid Graph Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) COMP2011-52 |
The shortest path problem is one of the most important problem in computer science and has many practical applications, ... [more] | COMP2011-52 pp.39-44 |
| COMP | 2009-10-16 10:35 |
Miyagi | Tohoku University | Small Grid Drawings of Planar Graphs with Balanced Bipartition Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) COMP2009-33 |
In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line... [more] | COMP2009-33 pp.9-15 |
| VLD | 2009-09-25 10:00 |
Osaka | Osaka University | An Approach for Algorithm Tuning of Power Grid Simulation by GPGPU Makoto Yokota, Yuuya Isoda, Hisako Sugano, Ittetsu Taniguchi, Masahiro Fukui (Ritsumeikan Univ.) VLD2009-36 |
This paper proposes a speeding up technique for massively parallel power gird simulator by GPGPU (General Purpose comput... [more] | VLD2009-36 pp.39-44 |
| VLD | 2009-03-13 10:05 |
Okinawa | A Study for Power Grid Simulator by using GPU Hisako Sugano, Shinichi Nishizawa, Taiki Hashizume, Masahiro Fukui (Ritsumeikan Univ.) VLD2008-158 |
The rapidity of technical innovation of GPU is much faster than CPU and above Moore’s law. Recently, there are some exam... [more] | VLD2008-158 pp.189-194 |
|
| CAS, MSS | 2008-11-06 10:20 |
Osaka | Osaka University | Separator-Based Graph Embedding into Higher-Dimensional Grids with Small Congestion Akira Matsubayashi (Kanazawa Univ.) CAS2008-47 CST2008-25 |
We study the problem of embedding a guest graph with minimum edge-congestion into a high dimensional grid of the same si... [more] | CAS2008-47 CST2008-25 pp.11-16 |
[Return to Top Page]