| 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 # | |
| COMP, IPSJ-AL | 2015-06-12 16:05 |
Hokkaido | A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi (Kanazawa Univ.)  COMP2015-7 |
In this report, we prove that no deterministic online page migration algorithm is (3+o(1))-competitive, where o-notation... [more] | COMP2015-7 pp.29-36 |
|
| COMP | 2012-12-10 15:15 |
Fukuoka | Kyushu University | A Lower Bound of Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks Youhei Kouchi, Akira Matsubayashi (Kanazawa Univ.) COMP2012-48 |
The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to con... [more] | COMP2012-48 pp.27-31 |
| CAS, MSS | 2011-11-18 13:30 |
Yamaguchi | Univ. of Yamaguchi | Minimum Energy Broadcast on Two Dimensional Triangular Grid Wireless Networks Youhei Kouchi, Akira Matsubayashi (Kanazawa Univ.) CAS2011-81 MSS2011-50 |
The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to con... [more] | CAS2011-81 MSS2011-50 pp.101-106 |
| COMP | 2010-06-25 14:35 |
Tokyo | Tokyo Tech | Minimum Energy Broadcast on Rectangular Grid Wireless Networks Atsushi Murata, Akira Matsubayashi (Kanazawa Univ.) COMP2010-20 |
The minimum energy broadcast problem is to assign a transmission range to each node in an ad hoc wireless network to con... [more] | COMP2010-20 pp.29-35 |
| 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 |
| CAS | 2005-01-19 10:20 |
Ishikawa | Kanazawa Univ | Optimal Wavelength Assignment on Optical 2-path Networks Hiroaki Takai, Akira Matsubayashi (Kanazawa Univ.) |
For a given (WDM optical) network $G$ and a set $\cal R$ of requests (source and target nodes) on $G$, the wavelength as... [more] | CAS2004-60 pp.1-6 |
| CAS | 2005-01-19 10:45 |
Ishikawa | Kanazawa Univ | A Polynomial Time Algorithm for Embedding Graphs into Ladder with Minimum Congestion Tomohiro Ikeda, Akira Matsubayashi (Kanazawa Univ.) |
The problem of efficiently implementing parallel algorithms into parallel computers can be formulated as the graph embed... [more] | CAS2004-61 pp.7-12 |
| CAS | 2005-01-19 11:10 |
Ishikawa | Kanazawa Univ | Competitive Online Data Migration Algorithm On Rings Ryosuke Ito, Akira Matsubayashi (Kanazawa Uni.) |
Data migration problem is, given a network $G$, a node $a_{0}$ of $G$ which holds a data $x$ of size $D$ initially, and ... [more] | CAS2004-62 pp.13-17 |
| CAS | 2005-01-19 11:35 |
Ishikawa | Kanazawa Univ | Small Congestion Embedding of Separable Graphs into Grids of the Same Size Akira Matsubayashi (Kanazawa Univ.) |
In this paper we consider the problem of embedding a (guest) graph into a grid with the same number of nodes as those of... [more] | CAS2004-63 pp.19-24 |
[Return to Top Page]