| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2005-09-15
09:25 |
Osaka |
Osaka Univ., Toyonaka Campus |
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Yosuke Kikuchi (JST), Toru Araki (Iwate Univ.) |
A bipartite graph $G$ is bipancyclic if $G$ has a cycle of length
$l$ for every even $4 \leq l \leq |V(G)|$.
For a... [more] |
COMP2005-28
pp.1-7 |
| COMP |
2005-09-15
10:00 |
Osaka |
Osaka Univ., Toyonaka Campus |
A construction method of synchronous reversible cellular automata using simple asynchronous logic elements
Jin-Shan Qi, Kenichi Morita (Hiroshima Univ.) |
We proposed a new method of realizing a synchronous reversible partitioned cellular automaton concisely, which is comput... [more] |
COMP2005-29
pp.9-16 |
| COMP |
2005-09-15
10:50 |
Osaka |
Osaka Univ., Toyonaka Campus |
Laminar Structure of Ptolemaic Graphs and Its Applications
Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) |
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices.
The graph class coincides with... [more] |
COMP2005-30
pp.17-24 |
| COMP |
2005-09-15
11:25 |
Osaka |
Osaka Univ., Toyonaka Campus |
The q-gram distance for ordered unlabeled trees
Nobuhito Ohkura, Kouichi Hirata (Kyushu Inst. Tech.), Tetsuji Kuboyama (Univ. Tokyo), Masateru Harao (Kyushu Inst. Tech.) |
[more] |
COMP2005-31
pp.25-29 |
| COMP |
2005-09-15
13:20 |
Osaka |
Osaka Univ., Toyonaka Campus |
[Tutorial Lecture]
NA
Akinori Kawachi (Tokyo Tech.) |
Applications of quantum information processing to cryptography has played a central role in the quantum information scie... [more] |
|
| COMP |
2005-09-15
14:35 |
Osaka |
Osaka Univ., Toyonaka Campus |
A Polynomial Space Polynomial Delay Algorithm for Enumerating Maximal Motifs in a Sequence
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) |
In this paper, we consider the problem of finding all maximal motifs in an input string for the class of repeated motifs... [more] |
COMP2005-32
pp.31-38 |
| COMP |
2005-09-15
15:10 |
Osaka |
Osaka Univ., Toyonaka Campus |
An algorithm for generating vertex sequences to extract maximum weight cliques quickly
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
Given an undirected graph with weight for each vertex, the maximum
weight clique problem is to find the clique of the ... [more] |
COMP2005-33
pp.39-42 |
| COMP |
2005-09-15
16:00 |
Osaka |
Osaka Univ., Toyonaka Campus |
A Weakly-Adaptive Condition-Based Consensus Algorithm in Asynchronous Distributed Systems
Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
While the (uniform) consensus problem is one of fundamental and
important problems for designing fault-tolerant distri... [more] |
COMP2005-34
pp.43-48 |
| COMP |
2005-09-15
16:35 |
Osaka |
Osaka Univ., Toyonaka Campus |
How Easy to Learn Linear Ranking Functions
Atsuyoshi Nakamura (Hokkaido Univ.) |
In this paper, we study how easy to learn the class of {\em linear ranking functions}
from $n$-dimensional Euclidean sp... [more] |
COMP2005-35
pp.49-53 |