|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Akinori Kawachi (Tokyo Inst. of Tech.), Takehiro Ito (Tohoku Univ.) |
|
| Conference Date |
Fri, Apr 22, 2011 09:30 - 17:45 |
| Topics |
|
| Conference Place |
Venture Business Laboratory, Kyoto University |
| Address |
Yoshida-Honmachi, Sakyo-ku, Kyoto, 606-8501 Japan |
| Transportation Guide |
http://www.vbl.kyoto-u.ac.jp/index.php?p=3100&lang=en |
Contact
Person |
Suguru Tamaki
+81-75-753-7571 |
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Fri, Apr 22
09:30 - 17:45 |
| (1) |
09:30-10:05 |
A construction method for non-left-recursive parsing expression grammars  COMP2011-1 |
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 COMP2011-2 |
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 COMP2011-3 |
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 COMP2011-4 |
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 COMP2011-5 |
Takuro Fukunaga (Kyoto Univ.) |
| (6) |
13:55-14:30 |
A further improved result on polynomial-time solvability of the maximum clique problem COMP2011-6 |
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 COMP2011-7 |
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 COMP2011-8 |
Yuuki Ono, Satoshi Yamane (Kanazawa Univ.) |
| (9) |
15:50-16:25 |
Online Prediction on Labeled Graphs COMP2011-9 |
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 COMP2011-10 |
Koji Kobayashi (NII), Jun Kawahara (JST) |
| (11) |
17:10-17:45 |
An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems COMP2011-11 |
Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Akinori Kawachi
Graduate School of Information Science and Engineering
Tokyo Institute of Technology
2-12-1 W8-25, Ookayama, Meguro-ku, Tokyo
Phone: +81-3-5734-3868
Email:     is    |
Last modified: 2011-03-08 16:56:38
|