|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Yoshio Okamoto (Tokyo Inst. of Tech.), Takashi Horiyama (Saitama Univ.) |
|
| Conference Date |
Fri, Mar 12, 2010 09:05 - 17:00 |
| Topics |
|
| Conference Place |
National Institute of Informatics, Rooms 2008, 2009 on the 20th Floor |
| Address |
2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430 Japan |
| Transportation Guide |
Tokyo Metro Hanzomon Line / Toei Mita Line / Toei Shinjuku Line "JIMBOCHO" Exit A8, A9 Toyko Metro Tozai Line"TAKEBASHI"Exit 1b 3-5 minutes walk from the stations
http://www.nii.ac.jp/en/access/ |
Contact
Person |
Prof. Takeaki Uno |
Fri, Mar 12
09:05 - 17:00 |
| (1) |
09:05-09:40 |
NP-Completeness and Enumeration of Number Link Puzzle |
Kouichi Kotsuma, Yasuhiko Takenaga (Univ. of Electro-Comm.) |
| (2) |
09:40-10:15 |
Bayesian Joint Optimization for Matrix Factorization and Clustering |
Tikara Hosino (Nihon Unisys, Ltd.) |
| (3) |
10:15-10:50 |
Note on Optimal Path for an Electric Vehicle |
Kimikazu Kato (Nihon Unisys, Ltd.) |
| |
10:50-11:00 |
Break ( 10 min. ) |
| (4) |
11:00-11:35 |
Deterministic Constant-Work-Space Algorithms for two dimensional Linear Programming |
Tetsuo Asano (JAIST), Danny Chen (Univ. of Notre Dame), Takeshi Tokuyama (Tohoku Univ.) |
| (5) |
11:35-12:10 |
On the Geodesic Diameter of Polygonal Domains |
Sang Won Bae (POSTECH), Matias Korman (Universite Libre de Broxelles, Belgium), Yoshio Okamoto (Tokyo Inst. of Tech.) |
| |
12:10-13:20 |
Lunch Break ( 70 min. ) |
| (6) |
13:20-13:55 |
On the standard local search for the independent set problem on d-claw free graphs |
Kazuyuki Kitayama, Toshihiro Fujito (Toyohashi Univ. of Tech.) |
| (7) |
13:55-14:30 |
Algorithm for detecting topological information in sensor network |
Ryota Narita, Takeshi Tokuyama (Tohoku Univ) |
| |
14:30-14:40 |
Break ( 10 min. ) |
| (8) |
14:40-15:40 |
[Invited Talk]
Inverse Rendering for Computer Graphics |
Imari Sato (NII) |
| |
15:40-15:50 |
Break ( 10 min. ) |
| (9) |
15:50-16:25 |
Online graph exploration algorithms for cycles and trees by multiple number of searchers |
Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) |
| (10) |
16:25-17:00 |
Time and Space Efficient Graph Exploration by a Mobile Agent Using Whiteboard |
Yuichi Sudo, Daisuke Baba, Junya Nakamura, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Invited Talk | Each speech will have 50 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 |
Yoshio Okamoto
Graduate School of Information Science and Engineering
Tokyo Institute of Technology
2-12-1-W8-88, Ookayama, Meguro-ku, Tokyo
Phone: +81-3-5734-3871
Email:     is    |
Last modified: 2010-01-22 18:57:28
|