| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2011)
Search Results: Keywords 'from:2011-12-16 to:2011-12-16'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2011-12-16 09:30 |
Aichi | Nagoya Univ. | A compact DFA representation using dual position automata Hiroaki Yamamoto, Shogo Nakamura (Shinshu Univ.)  COMP2011-36 |
This paper introduces an automaton model called {\em a dual position automaton} (a dual PA), and then gives a bit-paral... [more] |
COMP2011-36 pp.1-7 |
| COMP | 2011-12-16 10:00 |
Aichi | Nagoya Univ. | Relationship Between Coding Theory and Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (NITech) COMP2011-37 |
Counting perfect matchings is known as one of the hard problems to obtain exact results, which is proven to be \#P-comp... [more] |
COMP2011-37 pp.9-15 |
| COMP | 2011-12-16 10:45 |
Aichi | Nagoya Univ. | Algorithms for Bandwidth Consecutive Multicolorings of Graphs Kazuhide Nishikawa, Takao Nishizeki (Kwansei Gakuin Univ.), Xiao Zhou (Tohoku Univ.) COMP2011-38 |
[more] | COMP2011-38 pp.17-24 |
| COMP | 2011-12-16 11:15 |
Aichi | Nagoya Univ. | Reconfiguration of Vertex Covers in Trees and Cacti Hiroyuki Nooka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2011-39 |
We study the problem of reconfiguring a vertex cover of a graph $G$ into another vertex cover via vertex covers of $G$, ... [more] |
COMP2011-39 pp.25-32 |
| COMP | 2011-12-16 13:00 |
Aichi | Nagoya Univ. | How to guard a graph against tree movements Takayoshi Sakamaki, Toshihiro Fujito (TUT) COMP2011-40 |
This paper shows that the optimization problem arising from the guarding game played between the cop and robber players ... [more] | COMP2011-40 pp.33-36 |
| COMP | 2011-12-16 13:30 |
Aichi | Nagoya Univ. | Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Ochanomizu Univ.), Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2011-41 |
[more] | COMP2011-41 pp.37-44 |
| COMP | 2011-12-16 14:00 |
Aichi | Nagoya Univ. | Pattern Formation Algorithm with Reference-Robot-Assignment Function for Asynchronous, Anonymous, Oblivious Robots Yasumasa Sujaku, Kiyoaki Yoshida, Tosiro Koga (Kurume I. T.) COMP2011-42 |
[more] | COMP2011-42 pp.45-52 |
| COMP | 2011-12-16 14:45 |
Aichi | Nagoya Univ. | Minimizing the Number of Heald Frames under the Constraint of Uniform Tension Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.) COMP2011-43 |
A dobby loom is a weaving machine prevailing in the textile industry. The more heald frames a dobby loom is equipped wit... [more] | COMP2011-43 pp.53-60 |
| COMP | 2011-12-16 15:15 |
Aichi | Nagoya Univ. | Image Segmentation Using Maximum Weight Region Jinhee Chun, Natsuda Kaothanthong, Takeshi Tokuyama (Tohoku Univ.) COMP2011-44 |
In this paper, we present the image segmentation result using the algorithm for computing the Maximum Weight Region. An ... [more] | COMP2011-44 pp.61-67 |
| COMP | 2011-12-16 16:00 |
Aichi | Nagoya Univ. | [Invited Talk]
HOPE-Japan: High-resolution Online-map Project for East-Japan Shin Aida (TUT) COMP2011-45 |
HOPE-Japan is a big industry-academic-government-citizen project for containing the damage by information gap of quake a... [more] | COMP2011-45 p.69 |
| COMP | 2011-12-16 17:15 |
Aichi | Nagoya Univ. | [Invited Talk]
Research Story on Distance Trisector Curves: How was it born and developed? Tetsuo Asano (JAIST), Takeshi Tokuyama (Tohoku Univ.), Keiko Imai (Chuo Univ.), Akitoshi Kawamura (Univ. of Tokyo) COMP2011-46 |
It is easy to draw a bisecting line for two points in the plane. Is it also easy to draw two curves between two points t... [more] | COMP2011-46 p.71 |
[Return to Top Page]