| 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: Koichi Wada (Hosei Univ.) Vice Chair: Toshimitsu Masuzawa (Osaka Univ.) Secretary: Sayaka Kamei (Hiroshima Univ.), Hisashi Koga (Univ. of Electro-Comm.) DATE: Tue, Sep 2, 2014 10:00 - 17:30 PLACE: TOPICS: ---------------------------------------- Tue, Sep 2 AM (10:00 - 17:30) ---------------------------------------- (1) 10:00 - 10:30 Memory-Efficient Indexing Structure for Permuted Pattern Matching on Multi-Track Strings Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) (2) 10:30 - 11:00 A linear time algorithm for finding a spanning tree with non-terminal set $V_{NT}$ on cographs Shin-ichi Nakayama (Univ. of Tokushima), Shigeru Masuyama (Toyohashi Univ. of Tech.) (3) 11:00 - 11:30 An Algorithm for Feedback Vertex Set Problem on a Non-degenerate Circular-arc Graph Hirotoshi Honma, Yoko Nakajima (Kushiro NCT), Shigeru Masuyama (Toyohashi Univ. Tech.) (4) 11:30 - 12:00 On the number of matrix multiplications in the evaluation of the matrix polynomial I+A+A^2+...+A^{N-1} Kotaro Matsumoto, Naofumi Takagi, Kazuyoshi Takagi (Kyoto Univ.) ----- Lunch Break ( 90 min. ) ----- (5) 13:30 - 14:30 [Invited Talk] Modeling and Algorithm/Complexity Theory -- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples -- Shigeru Masuyama (Toyohashi Univ. of Tech.) ----- Break ( 15 min. ) ----- (6) 14:45 - 15:15 The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms -- Preliminary Report -- Tomoyuki Yamakami (Univ. of Fukui) (7) 15:15 - 15:45 Quantum digital-to-analog conversion algorithm using decoherence Akira Saitoh (Toyohashi Univ. of Tech.) (8) 15:45 - 16:15 A Note on the Class of the Computational Comlexity of the Coin-Exchange Problem of Frobenius Shunichi Matsubara (Aoyama Gakuin Univ.) ----- Break ( 15 min. ) ----- (9) 16:30 - 17:00 Parallel Algorithm for Determining Shortest Paths in DAG Masahiro Migita, Masashi Toda (Kumamoto Univ.) (10) 17:00 - 17:30 Algorithms for Group Gossiping of Mobile Agents Jun Ri, Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka 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: Wed, Oct 8, 2014: Chuo University [Thu, Aug 14] Fri, Dec 5, 2014: Sojo University [Thu, Oct 9] # SECRETARY: Hisashi Koga Graduate School of Information Systems, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, Japan E-mail:    is  c Last modified: 2014-08-15 14:49:33 |
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]