Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2006-05-24 10:40 |
Fukuoka |
Kyushu Institute of Technology |
Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs Toshimasa Ishii (Otaru Univ. of Commerce) |
For a finite ground set $V$, we call a set-function $r: 2^V \rightarrow Z^+$ monotone, if $r(X')\geq r(X)$ holds for... [more] |
COMP2006-10 pp.1-8 |
COMP |
2006-05-24 11:15 |
Fukuoka |
Kyushu Institute of Technology |
Embedding of a Qualitative Representation Language on a Two-Dimensional Plane Kazuko Takahashi, Takao Sumitomo (Kwansei Gakuin Univ.), Izumi Takeuti (AIST) |
This paper discusses embedding of PLCA expression on a two-dimensional plane. We have proposed PLCA as a new framework f... [more] |
COMP2006-11 pp.9-15 |
COMP |
2006-05-24 13:00 |
Fukuoka |
Kyushu Institute of Technology |
Approximating Tree Edit Distance Through String Edit Distance Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) |
We present a method to transform an ordered and rooted tree of bounded degree into a string, where it is done by computi... [more] |
COMP2006-12 pp.17-24 |
COMP |
2006-05-24 13:35 |
Fukuoka |
Kyushu Institute of Technology |
Average-case Analysis for the MAX-2SAT Problem Osamu Watanabe, Masaki Yamamoto (Tokyo Inst. of Tech.) |
We propose a simple probability model for MAX-2SAT instances for discussing the average-case com-
plexity of the MAX-2S... [more] |
COMP2006-13 pp.25-32 |
COMP |
2006-05-24 14:10 |
Fukuoka |
Kyushu Institute of Technology |
(4,1)-Quantum Random Access Coding Does Not Exist Masahito Hayashi (JST), Kazuo Iwama (Kyoto Univ.), Harumichi Nishimura (Osaka Prefecture Univ.), Rudy Raymond (Kyoto Univ.), Shigeru Yamashita (NAIST) |
An (n,1,p)-Quantum Random Access (QRA) coding, introduced by Ambainis,
Nayak, Ta-shma and Vazirani in ACM Symp. on The... [more] |
COMP2006-14 pp.33-38 |
COMP |
2006-05-24 15:00 |
Fukuoka |
Kyushu Institute of Technology |
DNA Sequence Design Using Hidden Markov Models Kazuya Maemura, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
DNA computing is a new computation paradigm to take reaction process of DNA as computation.The design of DNA sequence is... [more] |
COMP2006-15 pp.39-46 |
COMP |
2006-05-24 15:35 |
Fukuoka |
Kyushu Institute of Technology |
DNA Sequence Design by Dynamic Neighborhood Searches Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
In recent years, DNA sequence sets are used in various fields such as nanotechnology and nanocomputing. Since there are ... [more] |
COMP2006-16 pp.47-54 |