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: Masafumi Yamashita Vice Chair: Tatsuya Akutsu
Secretary: Keisuke Tanaka, Kunihiko Sadakane

DATE:
Fri, Sep 17, 2004 10:30 - 16:30

PLACE:
(011-706-6496)

TOPICS:


----------------------------------------
Fri, Sep 17 AM (10:30 - 16:30)
----------------------------------------

(1) 10:30 - 11:00
Space-Saving Linear-Time Approximation Algorithm for Grammar-Based Compression
Takuya Kida (Hokkaido Univ.), Hiroshi Sakamoto, Shinichi Shimozono (KIT)

(2) 11:00 - 11:30
Faster bit-parallel algorithms for translating regular expressions into NFAs
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech), Masayuki Okamoto (Shinshu Univ.)

(3) 11:30 - 12:00
Nondegenerate 2-state 3-symbol reversible logic elements are all universal
Tsuyoshi Ogiro, Atsushi Kanno, Keiji Tanaka, Hiroko Kato, Kenichi Morita (Hiroshima Univ.)

----- Lunch Break ( 75 min. ) -----

(4) 13:15 - 13:45
Mapping Conditions for Alignment of Trees
Tetsuji Kuboyama (Univ. of Tokyo), Akira Yasuhara (Tokyo Gakugei Univ.), Tetsuhiro Miyahara (Hiroshima City Univ.)

(5) 13:45 - 14:15
Fast Algorithms for Comparison of Similar Unordered Trees
Daiji Fukagawa, Tatsuya Akutsu (Kyoto Univ.)

(6) 14:15 - 14:45
Synchronous Condition-based Consensus Algorithm Adapting to Input-Vector Legality
Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)

----- Break ( 15 min. ) -----

(7) 15:00 - 15:30
A group action graph representation of the Kautz digraph
Yuuki Tanaka, Yukio Shibata (Gunma Univ.)

(8) 15:30 - 16:00
Minimum 2-Vertex-Connectivity Augmentation for Specified Vertices of a Graph with Degree Constraints
Toshiya Mashima (Hiroshima International Univ.), Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)

(9) 16:00 - 16:30
An algorithm for computing natural neighbor interpolation
Hisamoto Hiyoshi (Gunma Univ.)

# Information for speakers
General Talk will have 25 minutes for presentation and 5 minutes for discussion.


=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:

Thu, Oct 14, 2004 - Fri, Oct 15, 2004: Tohoku University [Mon, Aug 23]
Fri, Dec 10, 2004: Toho University [Sat, Oct 23]


Last modified: 2004-07-22 11:51:05


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]

[Return to IEICE Web Page]


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