| 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 # | |
| NS, IN (Joint) |
2013-03-08 09:00 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Quick Evacuation Problem for Evacuation Navigation System in The Time of Disaster Yuki Takayama, Hiroyoshi Miwa (Kwansei Gakuin Univ.)  IN2012-208 |
The Great East Japan Earthquake in 2011 raised people's awareness of disaster prevention. Quick evacuation in an inner-... [more] |
IN2012-208 pp.323-328 |
| COMP | 2012-09-03 10:50 |
Tokyo | Hosei University | An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is: ... [more] |
COMP2012-28 pp.17-24 |
| CAS, CS, SIP | 2012-03-09 15:10 |
Niigata | The University of Niigata | On the Complexity of Energy-Aware Mapping for NoCs Satoshi Tayu, Anish Man Singh Shrestha, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2011-146 SIP2011-166 CS2011-138 |
To overcome the complex communication problems that arise as the number of on-chip components increases, NoCs have b... [more] |
CAS2011-146 SIP2011-166 CS2011-138 pp.219-224 |
| NS, IN (Joint) |
2012-03-09 10:10 |
Miyazaki | Miyazaki Seagia | Sensor Location Problem for Intruder Detection Yuta Nakazono, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2011-162 |
With the advancement of sensor network technology, sensor network systems are expected to be used for border security an... [more] | IN2011-162 pp.151-156 |
| NS, IN (Joint) |
2012-03-09 14:30 |
Miyazaki | Miyazaki Seagia | Design Method of Robust Network with Small Diameter during Failures Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2011-252 |
A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual ... [more] | NS2011-252 pp.409-414 |
| COMP | 2011-10-21 11:10 |
Miyagi | Tohoku Univ. | An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] | COMP2011-30 pp.15-22 |
| COMP | 2011-04-22 13:55 |
Kyoto | Kyoto University | A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] | COMP2011-6 pp.41-48 |
| IN, NS (Joint) |
2011-03-04 14:10 |
Okinawa | Okinawa Convention Center | Control Method of Autonomously Formed Unstructured P2P Network Based on Usage History Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2010-206 |
P2P(Peer-to-Peer) network systems in contrast to client/server systems is expected in many fields such as not only file ... [more] | IN2010-206 pp.371-376 |
| COMP | 2010-12-03 14:30 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | An improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP2010-43 |
This report presents an improved result for polynomial-time solvability of the maximum clique problem which is a typical... [more] | COMP2010-43 pp.29-36 |
| NS, IN (Joint) |
2010-03-05 09:50 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | Design Method of Smallest Robust Networks against Performance Deterioration during Failures Nozomu Katayama, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.), Noriaki Kamiyama, Haruhisa Hasegawa, Hideaki Yoshino (NTT) NS2009-228 |
A telecommunication network should be reliable, since it is important as social infrastructure. But it is known that, in... [more] | NS2009-228 pp.369-374 |
| NS, IN (Joint) |
2010-03-05 10:20 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | Traffic Engineering by Polynomially Solvable Link Metric Optimization Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2009-229 |
Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. As the routes of paths... [more] | NS2009-229 pp.375-380 |
| COMP | 2009-09-14 11:15 |
Tottori | Tottori University of Environmental Studies | Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] | COMP2009-26 pp.9-12 |
| IN, NS (Joint) |
2009-03-03 11:50 |
Okinawa | Okinawa-Zanpamisaki Royal Hotel | A Design Method of Robust Networks against Performance Deterioration in Failures Nozomu Katayama, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.), Noriaki Kamiyama, Haruhisa Hasegawa, Hideaki Yoshino (NTT) NS2008-164 |
A telecommunication network should be reliable, since it is important as social infrastructure. But it is known that, i... [more] | NS2008-164 pp.117-122 |
| IN, NS (Joint) |
2009-03-04 08:20 |
Okinawa | Okinawa-Zanpamisaki Royal Hotel | Improvements in the WDS Clustering Algorithm for Wireless Internet-access Mesh Networks Shigeto Tajima (Osaka Univ.), Nobuo Funabiki (Okayama Univ.), Teruo Higashino (Osaka Univ.) NS2008-204 |
We have studied the Wireless Internet-access Mesh NETwork (WIMNET) as a large-scale multihop wireless network using Wire... [more] | NS2008-204 pp.343-348 |
| COMP | 2008-05-13 13:55 |
Fukuoka | Kyushu Sangyo University | NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11 |
This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] | COMP2008-11 pp.25-32 |
| IN | 2007-12-14 10:00 |
Hiroshima | Hiroshima City University | A Heuristic Algorithm for Access Point Allocation in Indoor Environments for Wireless Mesh Networks Tamer Farag, Nobuo Funabiki, Toru Nakanishi (Okayama Univ.) IN2007-108 |
We have studied WIMNET (Wireless Internet-access Mesh NETwork) as a flexible and inexpensive large-scale access network ... [more] | IN2007-108 pp.55-60 |
| NS | 2007-10-19 10:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A proposal of a routing tree generation algorithm for minimizing the maximum delay in wireless mesh networks Kanako Uemura, Nobuo Funabiki, Toru Nakanishi, Tamer Farag (Okayama Univ.) NS2007-90 |
We have studied the Wireless Internet-access Mesh NETwork (WIMET) as a scalable wireless network to access the Internet.... [more] | NS2007-90 pp.57-62 |
| COMP | 2007-06-29 14:40 |
Hokkaido | Hokkaido University | On the complexity of planar n/k-coloring problems Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2007-25 |
This paper considers the {\it $n/k$-coloring problem} ({\it Circular Coloring}), which is a subproblem of the $H$-color... [more] |
COMP2007-25 pp.55-62 |
| NS, IN (Joint) |
2007-03-09 15:00 |
Okinawa | Okinawa Convention Center | A WDS Clustering Problem for Wireless Infrastructure Mesh Networks Shigeto Tajima (Osaka Univ.), Nobuo Funabiki (Okayama Univ.), Teruo Higashino (Osaka Univ.) NS2006-220 |
We have studied the Wireless Infrastructure Mesh NETwork (WIMNET) as a large-scale multihop wireless network. WIMNET i... [more] |
NS2006-220 pp.323-328 |
| COMP | 2006-10-17 11:00 |
Miyagi | Tohoku University | Efficient Algorithms for Airline problem Ryuhei Uehara (JAIST) |
It is known that the airlines in the real world form small-world network. This fact implies that they are constructed w... [more] |
COMP2006-34 pp.25-31 |
[Return to Top Page]