| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Hiro Ito (Univ. of Electro-Comm.) Vice Chair: Yushi Uno (Osaka Pref. Univ.) Secretary: Kazuhisa Seto (Seikei Univ.), Toshiki Saito (Kyushu Inst. of Tech.) DATE: Mon, Mar 5, 2018 10:00 - 17:30 PLACE: Nakamozu Campus, Osaka Prefecture University(1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531, Japan. https://www.osakafu-u.ac.jp/en/info/access/) TOPICS: ---------------------------------------- Mon, Mar 5 AM (10:00 - 17:30) ---------------------------------------- (1) 10:00 - 10:25 Relationship between Retweet and Structure of the Twitter Network Tatsuya Fukushima (Waseda Univ.) (2) 10:25 - 10:50 The Growth of Non-Giant Component in Preferentially-Attached Networks Takahiro Shimomura, Hiroshi Toyoizumi (Waseda Univ.) ----- Break ( 10 min. ) ----- (3) 11:00 - 11:50 [Invited Talk] Stochastic Packing Integer Programs with Few Queries Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) ----- Break ( 90 min. ) ----- (4) 13:20 - 14:10 [Invited Talk] Space-Efficient Algorithms for Longest Increasing Subsequence Masashi Kiyomi (Yokohama City Univ.), Hirotaka Ono (Nagoya Univ.), Yota Otachi (Kumamoto Univ.), Pascal Schweitzer (TU Kaiserslautern), Jun Tarui (UEC) ----- Break ( 15 min. ) ----- (5) 14:25 - 14:50 Analysis of Polynomial-time Learnability with Membership Queries Mikito Nanashima (Tokyo Inst. of Tech.) (6) 14:50 - 15:15 A recognition algorithm for simple-triangle graphs Asahi Takaoka (Kanagawa Univ.) ----- Break ( 15 min. ) ----- (7) 15:30 - 15:55 Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) (8) 15:55 - 16:20 Implementation of global partition algorithm and verification of hyperfiniteness for property testing of real-world networks Yutaro Honda (Osaka Pref. Univ.), Hiro Ito (UEC), Munehiko Sasajima (Univ. of Hyogo), Yushi Uno (Osaka Pref. Univ.) (9) 16:20 - 16:45 On Settlement Fund Circulation Problem Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.) ----- Break ( 15 min. ) ----- (10) 17:00 - 17:30 # Information for speakers General Talk will have 20 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Fri, May 25, 2018 - Sat, May 26, 2018: Nagoya Institute of Technology [Fri, Mar 16] # SECRETARY: Kazuhisa Seto Faculty of Science and Technology, Seikei University Address: 3-3-1 Kichijoji-Kitamachi, Musashino-shi, Tokyo 180-8633, Japan E-mail:    st i i Last modified: 2018-03-02 16:15:54 |
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 | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]