| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2017)
Search Results: Keywords 'from:2017-05-12 to:2017-05-12'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2017-05-12 13:30 |
Nagasaki |  COMP2017-1 |
(To be available after the conference date) [more] | COMP2017-1 pp.1-8 |
|
| COMP, IPSJ-AL | 2017-05-12 14:00 |
Nagasaki | An RBT Decision Tree Construction for Sparse Rules Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2017-2 |
Packet classification problem is to determine the highest priority rule that matches with an incoming packet in a networ... [more] | COMP2017-2 pp.9-15 |
|
| COMP, IPSJ-AL | 2017-05-12 15:20 |
Nagasaki | Bulk Execution of the Dynamic Programming for the Optimal Polygon Triangulation on the GPU Kohei Yamashita, Yasuaki Ito, Koji Nakano (Hiroshima Univ.) COMP2017-3 |
[more] | COMP2017-3 pp.17-22 |
|
| COMP, IPSJ-AL | 2017-05-12 15:50 |
Nagasaki | A GPU Implementation of the Smith-Waterman Algorithm using Bitwise Parallel Bulk Computation Technique Takahiro Nishimura (Hiroshima Univ.), Jacir L. Bordim (UnB), Yasuaki Ito, Koji Nakano (Hiroshima Univ.) COMP2017-4 |
[more] | COMP2017-4 pp.23-30 |
|
| COMP, IPSJ-AL | 2017-05-13 10:00 |
Nagasaki | Acute Constrains in Straight-Line Drawings of Planar Graphs Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.) COMP2017-5 |
Recent research on graph drawing focuses on Right-Angle-Crossing (RAC) drawings of 1-plane graphs, where each edge is dr... [more] | COMP2017-5 pp.31-38 |
|
| COMP, IPSJ-AL | 2017-05-13 10:30 |
Nagasaki | Approximating Bounded Degree Deletion via Matroid Matching Toshihiro Fujito (TUT) COMP2017-6 |
[more] | COMP2017-6 pp.39-45 |
|
| COMP, IPSJ-AL | 2017-05-13 11:00 |
Nagasaki | Approximability of the distance independent set problem on cubic graphs Hiroshi Eto (Kyushu Univ), Takehiro Ito (Tohoku Univ), Zhilong Liu, Eiji Miyano (Kyutech) COMP2017-7 |
[more] | COMP2017-7 pp.47-54 |
|
| COMP, IPSJ-AL | 2017-05-13 13:30 |
Nagasaki | Practical Linear-Time Algorithm for Estimation of Silhouette after Folding Crease Pattern Koji Ouchi, Kazuaki Yamazaki, Ryuhei Uehara (JAIST) COMP2017-8 |
In the recent years, a variety of software to simulate origami have been developed to investigate the possibility of app... [more] | COMP2017-8 pp.55-60 |
|
| COMP, IPSJ-AL | 2017-05-13 14:00 |
Nagasaki | λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.) COMP2017-9 |
In the obnoxious facility game, we design mechanisms that output a location of an undesirable facility based on the loca... [more] | COMP2017-9 pp.61-68 |
|
| COMP, IPSJ-AL | 2017-05-13 14:30 |
Nagasaki | Automatic Drawing for Metro Maps in Tokyo Masahiro Onda, Masaki Moriguchi, Keiko Imai (Chuo Univ.) COMP2017-10 |
Metro maps are useful tools for passengers of complex city transportation networks.It is hrad to draw complex metro maps... [more] | COMP2017-10 pp.69-76 |
|
| COMP, IPSJ-AL | 2017-05-13 15:50 |
Nagasaki | On Equivalence of de Bruijn Graphs and State-minimized Finite Automata Yoshiaki Takahashi (Solar), Akira Ito (Yamaguchi Univ.) COMP2017-11 |
A de Bruijn sequence of order n on the alphabet {0,1} is a cyclic sequence in which every possible string of length n ov... [more] | COMP2017-11 pp.77-83 |
|
| COMP, IPSJ-AL | 2017-05-13 16:20 |
Nagasaki | Design Conditions and Optimization for RT-level Circuit with Rollback Mechanism Keisuke Inoue (KTC) COMP2017-12 |
[more] | COMP2017-12 pp.85-89 |
|
[Return to Top Page]