| 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 | 2024-03-14 13:30 |
Tokyo | The University of Electro-Communications | [Invited Talk]
Gap Amplification for Reconfiguration Problems Naoto Ohsaka (CyberAgent)  COMP2023-31 |
Combinatorial reconfiguration is an emerging field of theoretical computer science that studies the reachability between... [more] | COMP2023-31 p.22 |
| COMP | 2022-12-06 09:30 |
Ehime | Ehime Univ. Media Hall | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) COMP2022-21 |
We consider the reconfiguration and enumeration problems of optimal cyclic ladder lotteries. First, we investigate the t... [more] | COMP2022-21 pp.1-8 |
| COMP, IPSJ-AL | 2020-09-01 14:40 |
Online | Online | Complexity of Colored Token Shifting on Graphs Sai Kwon Kham, Ryuhei Uehara (JAIST) COMP2020-6 |
Variations of reconfiguration problems are much of interest and important problems in theoretical computer science. The ... [more] | COMP2020-6 pp.1-8 |
| COMP | 2019-12-13 17:00 |
Gunma | Ikaho Seminar House, Gunma University | COMP2019-42 |
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] | COMP2019-42 pp.93-100 |
| COMP | 2018-12-12 10:25 |
Miyagi | Tohoku University | Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2018-32 |
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] | COMP2018-32 pp.7-14 |
| NS | 2017-04-20 13:55 |
Toyama | Toyama Shoko Kaigisyo | Refactoring IP structure for flexible network reconfiguration Aki Fukuda, Shohei Kamamura, Hiroshi Yamamoto, Rie Hayashi, Yoshihiko Uematsu (NTT) NS2017-2 |
A wide area IP network has to be reconfigured flexibly to rationalize utilization of network resources to the network en... [more] | NS2017-2 pp.7-12 |
| COMP | 2015-04-23 13:10 |
Miyagi | Algorithms for Dominating Set Reconfiguration Problem Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo) COMP2015-1 |
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given th... [more] |
COMP2015-1 pp.1-7 |
|
| CQ, CS (Joint) |
2015-04-21 11:55 |
Fukuoka | Fukuoka Institute of Technology | Evaluation of High-Speed Reconfiguration in Virtual Path Embedding Ryutaro Matsumura, Hirotada Honda, Toshiaki Tsuchiya, Akira Takahashi (NTT) CQ2015-6 |
Since the advance of SDN technology, network virtualization mechanisms for telecommunication carriers have been integrat... [more] | CQ2015-6 pp.27-32 |
| COMP | 2014-04-24 14:20 |
Miyagi | Tohoku University | Reconfiguration of Dominating Sets Akira Suzuki (Tohoku Univ.), Amer Mouawad, Naomi Nishimura (Univ. of Waterloo) COMP2014-5 |
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S... [more] |
COMP2014-5 pp.29-35 |
| COMP | 2013-12-20 09:55 |
Okinawa | Okinawa Industry Support Center | Algorithms for Independent Set Reconfiguration Problem on Graphs Erik D. Demaine, Martin L. Demaine (Massachusetts Inst. of Tech.), Takehiro Ito (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Ryuhei Uehara (JAIST) COMP2013-39 |
Suppose that we are given two independent sets Ib and Ir of a graph such that |Ibj| = |Ir|, and imagine that a token is ... [more] | COMP2013-39 pp.7-14 |
| COMP | 2012-12-10 15:50 |
Fukuoka | Kyushu University | Reconfiguration of List L(2,1)-Labelings in a Graph Takehiro Ito, Kazuto Kawamura (Tohoku Univ.), Hirotaka Ono (Kyushu Univ.), Xiao Zhou (Tohoku Univ.) COMP2012-49 |
For an integer $k \ge 0$, suppose that each vertex $v$ of a graph $G$ has a set $C(v) \subseteq \{0,1, \ldots, k\}$ of l... [more] | COMP2012-49 pp.33-40 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-28 10:30 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | A Hardware Algorithm Using Dynamically Partially Reconfigurable FPGAs for Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) RECONF2012-53 |
In this paper, we propose a hardware algorithm to solve the maximum clique problem of large graphs, and show its impleme... [more] | RECONF2012-53 pp.33-38 |
| RECONF | 2011-05-12 15:00 |
Hokkaido | Hokkaido Univ. (Faculty of Eng., B3 Bldg.) | Design and Implementation of a Portable Framework for PCI Express Interface Shoichi Igarashi, Ryuhei Morita, Yuichi Okuyama (Univ. of Aizu), Tsuyoshi Hamada (Nagasaki Univ.), Junji Kitamichi, Kenichi Kuroda (Univ. of Aizu) RECONF2011-8 |
In this paper, we propose a portable framework for PCI Express interface. The proposed framework provides DMA transfer a... [more] | RECONF2011-8 pp.43-48 |
| RECONF, VLD, CPSY, IPSJ-SLDM [detail] | 2011-01-18 14:30 |
Kanagawa | Keio Univ (Hiyoshi Campus) | Implementation of Dynamic Reconfigurable Processor with Multi-Accelerator Shuhei Igari, Junji Kitamichi, Yuichi Okuyama, Kenichi Kuroda (Aizu Univ.) VLD2010-108 CPSY2010-63 RECONF2010-77 |
Recently, System on a Chip (SoC) has problems increasing of the scale of circuit and design cost, because SoC contains m... [more] | VLD2010-108 CPSY2010-63 RECONF2010-77 pp.163-168 |
| DC | 2010-12-10 15:40 |
Tottori | International Family Plaza (Yonago) | Design and Implementation of a Distributed Control System for Flexible System Reconfiguration Yuta Takeda, Hiroshi Mochizuki, Hideo Nakamura (Nihon Univ.) DC2010-55 |
At present, a distributed control system that realizes more advanced work in real time is noted. And there are many rese... [more] | DC2010-55 pp.21-24 |
| RECONF | 2010-09-16 11:00 |
Shizuoka | Shizuoka University (Faculty of Eng., Hall 2) | Development of an On-chip Pattern Recognition System using Dynamic and Partial Reconfiguration Hiroyuki Kawai, Moritoshi Yasunaga (Tsukuba Univ.) RECONF2010-18 |
In this paper, we develop an on-chip pattern recognition system. The feature of this system is that two Microblaze core... [more] |
RECONF2010-18 pp.1-6 |
| R | 2009-07-31 13:20 |
Hokkaido | Design of an Interface Board with a Reconfiguration Method Hiroshi Mochizuki, Takuya Anzawa, Sei Takahashi, Hideo Nakamura (Nihon Univ.) R2009-23 |
At present, a distributed control system that realizes more advanced work in real time is noted. And there are many rese... [more] | R2009-23 pp.7-10 |
|
| CPSY | 2008-12-18 16:10 |
Kyoto | KYOTO Research Park | An Architecture of Dynamically Reconfigurable Systolic Array and FPGA Implementation Toshiyuki Ishimura, Yuhki Hayakawa, Akinori Kanasugi (Tokyo Denki Univ.) CPSY2008-52 |
The dynamically reconfigurable processors which have high-speed performance of ASIC, flexibility of FPGA and high area e... [more] | CPSY2008-52 pp.55-60 |
| COMP | 2008-10-10 10:00 |
Miyagi | Tohoku Univ. | On the Complexity of Reconfiguration Problems Takehiro Ito (Tohoku Univ.), Erik D. Demaine, Nicholas J. A. Harvey (MIT), Christos H. Papadimitriou (UC Berkeley), Martha Sideri (AUEB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Prefecture Univ.) COMP2008-36 |
Reconfiguration problems arise when we wish to find a step-by-step transformation between two feasible solutions of a pr... [more] | COMP2008-36 pp.17-24 |
| IN | 2008-07-17 14:45 |
Hyogo | Koube Univ. | An improvement of the interest mining method based on a network reconfiguration Naomi Aoki, Sayaka Kamei, Satoshi Fujita (Hiroshima Univ) IN2008-27 |
In unstructured peer-to-peer (P2P) systems, it is necessary to retrieve enough information and reduce the number of quer... [more] | IN2008-27 pp.7-12 |
[Return to Top Page]