| 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 # | |
| CQ | 2015-01-23 10:30 |
Tokyo | Proposal and Evaluation of Evacuation Guiding Scheme Using Trajectories of Mobile Terminals Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST)  CQ2014-104 |
When large-scale disasters occur, evacuees have to evacuate to safe places quickly. In this paper, we propose an evacu... [more] |
CQ2014-104 pp.101-106 |
|
| COMP | 2014-04-24 10:55 |
Miyagi | Tohoku University | Swapping Labeled Tokens on Graphs Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takehiro Ito (Tohoku Univ.), Jun Kawahara (NAIST), Masashi Kiyomi (Yokohama City Univ.), Yoshio Okamoto (Univ. of Electro-Comm.), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Kei Uchizawa (Yamagata Univ.), Takeaki Uno (NII) COMP2014-2 |
[more] | COMP2014-2 pp.5-12 |
| COMP | 2014-04-24 15:15 |
Miyagi | Tohoku University | Improved Bounds for Online $k$-Frame Throughput Maximization in Network Switches Koji Kobayashi (NII), Jun Kawahara (NAIST), Shuichi Miyazaki (Kyoto Univ.) COMP2014-6 |
We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maxim... [more] | COMP2014-6 pp.37-44 |
| COMP | 2013-03-18 13:45 |
Gifu | Gifu University | Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] | COMP2012-56 pp.23-30 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-26 10:55 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | An Efficient ZDD Construction Method Using Recursive Specifications Hiroaki Iwashita, Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.) VLD2012-63 DC2012-29 |
In recent years, new enumeration methods using zero-suppressed binary decision diagrams (ZDDs) has been attracting atten... [more] | VLD2012-63 DC2012-29 pp.25-29 |
| IN, NV (Joint) |
2012-07-19 17:10 |
Hokkaido | Hokkaido Univ. | [Invited Talk]
Analyzing power distribution networks by frontier-based method Takeru Inoue (JST), Keiji Takano (Tokyo IT), Takayuki Watanabe (Waseda Univ.), Jun Kawahara (JST), Ryo Yoshinaka (Kyoto Univ.), Akihiro Kishimoto (Tokyo IT), Koji Tsuda (AIST), Shin-ichi Minato (Hokkaido Univ.), Yasuhiro Hayashi (Waseda Univ.) IN2012-39 |
[more] | IN2012-39 pp.37-42 |
| COMP | 2012-06-21 09:30 |
Hokkaido | Hokkaido University | Generalization of ZDD Construction Algorithms for Enumerating and Indexing the Solutions of Combinatorial Problems Jun Kawahara (JST), Shin-ichi Minato (Hokkaido Univ.) COMP2012-12 |
There are various combinatorial problems whose solutions can be represented as a family of sets. The Zero-suppressed Bi... [more] | COMP2012-12 pp.1-7 |
| IN, NV (Joint) |
2011-07-21 17:10 |
Hokkaido | Hokkaido University | Entwork Reliability Evaluation Using Efficient Path Enumeration ALgorithms Toshiki Saitoh, Jun Kawahara, Ryo Yoshinaka, Takeru Inoue (JST), Shin-ichi Minato (Hokkaido Univ.) IN2011-55 |
Recently, novel algorithms that enumerate all possible paths on a graph have been proposed. They commonly take advantage... [more] | IN2011-55 pp.57-62 |
| COMP | 2011-04-22 16:35 |
Kyoto | Kyoto University | An Optimal Bound for the 2-Frame Throughput Maximization Problem Koji Kobayashi (NII), Jun Kawahara (JST) COMP2011-10 |
[more] | COMP2011-10 pp.69-76 |
| COMP | 2011-04-22 17:10 |
Kyoto | Kyoto University | An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST) COMP2011-11 |
[more] | COMP2011-11 pp.77-82 |
| COMP | 2005-10-19 09:35 |
Miyagi | Tohoku Univ. | Automated Competitive Analysis of Online Problems Takashi Horiyama, Kazuo Iwama, Jun Kawahara (Kyoto Univ.) |
In this paper we study the 2-Bin Exchangeable Online Knapsack Problem (2EOK) which is an extension of the 2-Bin Removab... [more] |
COMP2005-45 pp.7-12 |
[Return to Top Page]