|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Takashi Horiyama (Saitama Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.) |
|
| Conference Date |
Mon, Jun 16, 2008 09:45 - 16:45 |
| Topics |
|
| Conference Place |
School of Information Technology, JAIST |
| Address |
1- 1, Asahidai, Nomi, Ishikawa, 923-1292 Japan |
| Transportation Guide |
http://www.jaist.ac.jp/is/en/about/access.html |
Contact
Person |
Prof. Mitsuo Motoki |
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) |
Mon, Jun 16 AM
09:45 - 16:45 |
| (1) |
09:45-10:10 |
Online Uniformity of Integer Points on a Line  COMP2008-15 |
Tetsuo Asano (JAIST) |
| (2) |
10:10-10:45 |
Design and Analysis of Geometric Routing Algorithms Using Random Local Neighbors COMP2008-16 |
Kazushige Sato, Takeshi Tokuyama (Tohoku U.) |
| |
10:45-11:00 |
Break ( 15 min. ) |
| (3) |
11:00-11:35 |
A Context Tree Weighting Algorithm with an Adaptive Window COMP2008-17 |
Tomohiro I, Kohei Hatano, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) |
| (4) |
11:35-12:10 |
Efficient XPath Tree Pattern Matching Algorithm over XML Data Stream COMP2008-18 |
Kazuhito Hagio, Takashi Ohgami, Masayuki Takeda (Kyushu Univ.) |
| |
12:10-13:20 |
Lunch Break ( 70 min. ) |
| (5) |
13:20-14:20 |
Invited Talk
Mineo Kaneko (JAIST) |
| |
14:20-14:35 |
Break ( 15 min. ) |
| (6) |
14:35-15:00 |
Constant-Working-Space Image Scan with a Given Angle COMP2008-19 |
Tetsuo Asano (JAIST) |
| (7) |
15:00-15:35 |
Simulation of a certain Voting Game COMP2008-20 |
Ryuhei Uehara (JAIST), Yasuyuki Kawamura (Ehime Univ.), Hiromitsu Matsunaga, Mitsuo Motoki (JAIST) |
| (8) |
15:35-16:10 |
Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$ COMP2008-21 |
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) |
| (9) |
16:10-16:45 |
Property Testing on k-Vertex-Connectivity of Graphs COMP2008-22 |
Yuichi Yoshida, Hiro Ito (Kyoto Univ.) |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Takashi Horiyama
Division of Mathematics, Electronics and Informatics,
Graduate School of Science and Engineering, Saitama Univeristy
255 Shimo-Ohkubo, Sakura, Saitama 338-8570, Japan.
Phone/Fax: +81-48-858-3957
Email:      al i  i -u |
Last modified: 2008-06-10 13:43:57
|