| 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 # | |
| MSS, CAS, IPSJ-AL [detail] | 2018-11-12 16:15 |
Shizuoka | A Method for Improving Memory Efficiency of the Reachability Graph Generation Process in General Petri Nets Kohei Fujimori, Yojiro Harie, Katsumi Wasaki (Shinshu Univ.)  CAS2018-65 MSS2018-41 |
State space generator is one of the analysis functions of Petri net design tool HiPS (Hierarchical Petri net Simulator)... [more] |
CAS2018-65 MSS2018-41 pp.43-47 |
|
| 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 |
| COMP | 2014-10-08 14:45 |
Tokyo | Chuo University | Reconfiguration of List Colorings in a Graph Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29 |
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] | COMP2014-29 pp.19-24 |
| IN | 2014-06-27 10:50 |
Kagawa | Kagawa Univ. | Updating Method of Control-metric Information for Relational-metric Based Operation in Communication Networks Naoto Kawai, Ryoichi Shinkuma (Kyoto Univ.), Hiroyuki Kasai (Electro-Communications Univ.), Kazuhiro Yamaguchi (KDL), Tatsuro Takahashi (Kyoto Univ.) IN2014-26 |
People sometimes want to send a message only to someone who is interested in the content of the message. However, e-mai... [more] |
IN2014-26 pp.61-66 |
| COMP | 2013-04-24 10:00 |
Hyogo | Kobe University | Answering Reachability Queries by Extending Pruned BFSs to Paths Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-1 |
The graph reachability is a fundamental problem, both theoretically and practically. However, it is still a challenging ... [more] | COMP2013-1 pp.1-8 |
| NS, IN (Joint) |
2013-03-08 14:00 |
Okinawa | Okinawa Zanpamisaki Royal Hotel | Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-252 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] | NS2012-252 pp.505-510 |
| CQ, ICM, NS (Joint) |
2012-11-16 11:10 |
Shiga | Nagahama Inst. of Bio-Science and Tech. | An evaluation method for centrality of a WDM network using extended uneven distribution Kotaro Suzuki, Norihiko Shinomiya (Soka Univ.), Takuya Miyashita (Fujitsu), Kazuyuki Tajima, Takao Naito (Fujitsu Lab) ICM2012-35 |
According to the recent increasing communications traffic, there is necessity to invest WDM network equipments. From a ... [more] |
ICM2012-35 pp.35-39 |
| ICSS | 2012-03-16 13:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Study of Quantification Method of Security Measures by Consideration of Reachability of Attacks Tetsuro Kito, Satoshi Kai, Tomohiro Shigemoto, Satoshi Takemoto, Tadashi Kaji (Hitachi) ICSS2011-44 |
There are many users who feel uneasy about security to use cloud computing environment. To provide the cloud computing e... [more] | ICSS2011-44 pp.31-36 |
| IN, NS (Joint) |
2011-03-03 09:20 |
Okinawa | Okinawa Convention Center | Method for Finding Links Protected to Keep Reachability to Server during Failures Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-175 |
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] | NS2010-175 pp.69-74 |
[Return to Top Page]