| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2007-03-05
09:00 |
Tokyo |
The University of Electro-Communications |
Failure Detectors for Solving k-Set Agreement
Atsushi Sakata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2006-50
pp.1-6 |
| COMP |
2007-03-05
09:30 |
Tokyo |
The University of Electro-Communications |
On a Diagnosable System with Solutions represented by Boolean Expressions
Itaru Kataoka, Tetsuo Moriya (Kokushikan Univ.) |
Even if I suggest algorithm of a diagnose system expressing a diagnosis result with Boolean expression, and this algorit... [more] |
COMP2006-51
pp.7-12 |
| COMP |
2007-03-05
10:00 |
Tokyo |
The University of Electro-Communications |
Emulation of Ring Protocols on Trees Preserving Fault-Containment
Yukiko Yamauchi, Toshimitsu Masuzawa (Osaka Univ.), Doina Bein (Univ. of Texas) |
A desired property of a distributed, self-stabilizing protocol is
to minimize the impact of faults that can corrupt th... [more] |
COMP2006-52
pp.13-20 |
| COMP |
2007-03-05
10:45 |
Tokyo |
The University of Electro-Communications |
Vertex coloring of chordal+k_1e-k_2e graphs
Yusuke Miura, Yasuhiko Takenaga (UEC) |
[more] |
COMP2006-53
pp.21-27 |
| COMP |
2007-03-05
11:15 |
Tokyo |
The University of Electro-Communications |
Move complexity of gossiping among mobile agents
Tomoko Suzuki (Osaka Univ.), Taisuke Izumi (Nagoya Inst. of Tech.), Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
Mobile-agent-based distributed systems are
attracting widespread attention as the adaptive and flexible systems:
mobi... [more] |
COMP2006-54
pp.29-36 |
| COMP |
2007-03-05
14:20 |
Tokyo |
The University of Electro-Communications |
A Theoretical Study on Variable Ordering of Zero-suppressed BDDs for Frequent Item Set Mining
Shin-ichi Minato (Hokkaido Univ.) |
Recently, an efficient method has been proposed to use Zero-suppressed Binary Decision Diagrams \linebreak (ZBDDs) for e... [more] |
COMP2006-55
pp.37-42 |
| COMP |
2007-03-05
14:50 |
Tokyo |
The University of Electro-Communications |
A Public Dictionary Editing System for Machine Translation
Katsutoshi Terabe (UEC) |
[more] |
COMP2006-56
pp.43-50 |
| COMP |
2007-03-05
15:35 |
Tokyo |
The University of Electro-Communications |
Approximation algorithms for the degree 3 terminal steiner tree problem with restricted weights
Kazuma Naito (titech) |
The steiner tree problem asks for a smallest tree spanning a given subset $R$ of distinguished vertices.
We consider a ... [more] |
COMP2006-57
pp.51-58 |
| COMP |
2007-03-05
15:55 |
Tokyo |
The University of Electro-Communications |
A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission
Taisuke Izumi, Koichi Wada (Nagoya Inst. of Tech.) |
The (uniform) consensus, which is one of fundamental and important
problems for designing fault-tolerant distributed sy... [more] |
COMP2006-58
pp.59-66 |
| COMP |
2007-03-05
16:25 |
Tokyo |
The University of Electro-Communications |
Minimizing Interference of a Wireless Ad-Hoc Network in Plane
Taichi Tashiro, Takeshi Tokuyama (Tohoku Univ.), Magnus M. Halldorsson (Iceland Univ.) |
We consider interference minimization in wireless ad-hoc networks.
This is formulated as assigning a suitable transmiss... [more] |
COMP2006-59
pp.67-74 |