Fri, Apr 22
09:30 - 17:45 |
| (1) |
09:30-10:05 |
A construction method for non-left-recursive parsing expression grammars |
Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.) |
| (2) |
10:05-10:40 |
Stochastic Node Departure Process and Alive-Node Connection for P2P Systems |
Susumu Shibusawa, Mamoru Kobayashi, Hiroshi Ohno, Tatsuhiro Yonekura (Ibaraki Univ.) |
| |
10:40-10:50 |
Break ( 10 min. ) |
| (3) |
10:50-11:25 |
Construction of a SeqBDD representing a set of reversed sequences |
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) |
| (4) |
11:25-12:00 |
$\pi$DDs(PiDDs): Binary Decision Diagrams for Manipulating Sets of Combinations |
Shin-ichi Minato (Hokkaido Univ.) |
| |
12:00-13:20 |
Break ( 80 min. ) |
| (5) |
13:20-13:55 |
Approximation algorithms for the source location problem with local vertex-connectivity demands |
Takuro Fukunaga (Kyoto Univ.) |
| (6) |
13:55-14:30 |
A further improved result on polynomial-time solvability of the maximum clique problem |
Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) |
| (7) |
14:30-15:05 |
Reconstructing sets from distances given by graphs |
Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.) |
| |
15:05-15:15 |
Break ( 10 min. ) |
| (8) |
15:15-15:50 |
Computation of quantifier elimination of linear inequlities of first order predicate logic |
Yuuki Ono, Satoshi Yamane (Kanazawa Univ.) |
| (9) |
15:50-16:25 |
Online Prediction on Labeled Graphs |
Koji Kobayashi, Kunihiko Sadakane (NII) |
| |
16:25-16:35 |
Break ( 10 min. ) |
| (10) |
16:35-17:10 |
An Optimal Bound for the 2-Frame Throughput Maximization Problem |
Koji Kobayashi (NII), Jun Kawahara (JST) |
| (11) |
17:10-17:45 |
An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems |
Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST) |
is
