| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2004-09-17
10:30 |
Hokkaido |
Hokkaido University |
Space-Saving Linear-Time Approximation Algorithm for Grammar-Based Compression
Takuya Kida (Hokkaido Univ.), Hiroshi Sakamoto, Shinichi Shimozono (KIT) |
A space-efficient linear-time approximation algorithm for the grammar-based compression problem, which requests for a gi... [more] |
COMP2004-26
pp.1-8 |
| COMP |
2004-09-17
11:00 |
Hokkaido |
Hokkaido University |
Faster bit-parallel algorithms for translating regular expressions into NFAs
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech), Masayuki Okamoto (Shinshu Univ.) |
[more] |
COMP2004-27
pp.9-16 |
| COMP |
2004-09-17
11:30 |
Hokkaido |
Hokkaido University |
Nondegenerate 2-state 3-symbol reversible logic elements are all universal
Tsuyoshi Ogiro, Atsushi Kanno, Keiji Tanaka, Hiroko Kato, Kenichi Morita (Hiroshima Univ.) |
In the investigation of minimal machinery in reversible computing, we proved that each nondegenerate 2-state 3-symbol re... [more] |
COMP2004-28
pp.17-24 |
| COMP |
2004-09-17
13:15 |
Hokkaido |
Hokkaido University |
Mapping Conditions for Alignment of Trees
Tetsuji Kuboyama (Univ. of Tokyo), Akira Yasuhara (Tokyo Gakugei Univ.), Tetsuhiro Miyahara (Hiroshima City Univ.) |
A number of edit-based distance measures have been proposed to find a structural similarity between trees. Alignment of... [more] |
COMP2004-29
pp.25-32 |
| COMP |
2004-09-17
13:45 |
Hokkaido |
Hokkaido University |
Fast Algorithms for Comparison of Similar Unordered Trees
Daiji Fukagawa, Tatsuya Akutsu (Kyoto Univ.) |
We present fast algorithms for computing the largest common subtree (LCST) and for computing optimal alignment when two ... [more] |
COMP2004-30
pp.33-40 |
| COMP |
2004-09-17
14:15 |
Hokkaido |
Hokkaido University |
Synchronous Condition-based Consensus Algorithm Adapting to Input-Vector Legality
Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
This paper proposes a novel condition-based algorithm for the uniform
consensus in synchronous systems. The proposed a... [more] |
COMP2004-31
pp.41-48 |
| COMP |
2004-09-17
15:00 |
Hokkaido |
Hokkaido University |
A group action graph representation of the Kautz digraph
Yuuki Tanaka, Yukio Shibata (Gunma Univ.) |
De Bruijn digraphs and shuffle-exchange graphs are known to be useful
models for interconnection networks. They can be ... [more] |
COMP2004-32
pp.49-56 |
| COMP |
2004-09-17
15:30 |
Hokkaido |
Hokkaido University |
Minimum 2-Vertex-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints
Toshiya Mashima (Hiroshima International Univ.), Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
The 2-vertex-connectivity augmentation problem for a specified set ofvertices of a graph with degree constraints, 2VCA-S... [more] |
COMP2004-33
pp.57-64 |
| COMP |
2004-09-17
16:00 |
Hokkaido |
Hokkaido University |
An algorithm for computing natural neighbor interpolation
Hisamoto Hiyoshi (Gunma Univ.) |
An interpolation method based on the Voronoi diagram for data sites in the multi-dimensional Euclidean space is called t... [more] |
COMP2004-34
pp.65-72 |