| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Tetsuo Asano (JAIST) Vice Chair: Kazuhisa Makino (Univ. of Tokyo) Secretary: Akinori Kawachi (Tokyo Inst. of Tech.), Takehiro Ito (Tohoku Univ.) DATE: Fri, Apr 22, 2011 09:30 - 17:45 PLACE: Venture Business Laboratory, Kyoto University(Yoshida-Honmachi, Sakyo-ku, Kyoto, 606-8501 Japan. http://www.vbl.kyoto-u.ac.jp/index.php?p=3100&lang=en. Suguru Tamaki. +81-75-753-7571) TOPICS: ---------------------------------------- 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.) ----- 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.) ----- 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.) ----- 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) ----- 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) # Information for speakers General Talk will have 25 minutes for presentation and 10 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Wed, May 11, 2011: Shinshu Univ. [Tue, Mar 22] Thu, Jun 30, 2011: Hiroshima Univ. [Tue, Apr 12] # SECRETARY: 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 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]