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) [schedule] [select]
Chair Osamu Watanabe (Tokyo Inst. of Tech.)
Vice Chair Hiroki Arimura (Hokkaido Univ.)
Secretary Takeshi Koshiba (Saitama Univ.), Shuichi Miyazaki (Kyoto Univ.)

Conference Date Tue, May 13, 2008 10:40 - 16:30
Topics  
Conference Place  
Contact
Person
092-673-5411
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)

Tue, May 13 AM 
10:40 - 16:30
(1) 10:40-11:15 NP-Hardness of the Sorting Buffer Problem on the Unifrom Metric COMP2008-8 Yuichi Asahiro (Kyushu Sangyo Univ.), Kenichi Kawahara, Eiji Miyano (Kyushu Inst of Tech)
(2) 11:15-11:50 Minimum Energy Broadcasting on Wireless Networks in Manhattan Model COMP2008-9 Toshinori Yamada (Saitama Univ.)
  11:50-13:20 Lunch Break ( 90 min. )
(3) 13:20-13:55 GMDH-type neural network algorithm self-selecting optimum neural network architecture and its application to medical image recognition COMP2008-10 Tadashi Kondo (Tokushima Univ.)
(4) 13:55-14:30 NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 COMP2008-11 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.)
(5) 14:30-15:05 On Necessary Conditions of Linear Cover Time Random Walks COMP2008-12 Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyusyu Univ)
  15:05-15:20 Break ( 15 min. )
(6) 15:20-15:55 Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height COMP2008-13 Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII)
(7) 15:55-16:30 An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees COMP2008-14 Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.)

Contact Address and Latest Schedule Information
COMP Technical Committee on Theoretical Foundations of Computing (COMP)   [Latest Schedule]
Contact Address Takeshi Koshiba
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-3494
E: batii-u 


Last modified: 2008-03-31 16:11:51


Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.
 

[Presentation and Participation FAQ] (in Japanese)
 
[Cover and Index of IEICE Technical Report by Issue]
 

[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]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan