| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2017)
Search Results: Keywords 'from:2018-03-05 to:2018-03-05'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2018-03-05 10:00 |
Osaka | Osaka Prefecture Univ. | Relationship between Retweet and Structure of the Twitter Network Tatsuya Fukushima (Waseda Univ.)  COMP2017-45 |
We collect tweet data to visualize the spread of tweets and find out the relationship between the number of each users' ... [more] | COMP2017-45 pp.1-7 |
| COMP | 2018-03-05 10:25 |
Osaka | Osaka Prefecture Univ. | The Growth of Non-Giant Component in Preferentially-Attached Networks Takahiro Shimomura, Hiroshi Toyoizumi (Waseda Univ.) COMP2017-46 |
We analyze a toy model to give a scale-free network obtained by the preferential attachment with possible break-ups. We... [more] | COMP2017-46 pp.9-16 |
| COMP | 2018-03-05 11:00 |
Osaka | Osaka Prefecture Univ. | [Invited Talk]
Stochastic Packing Integer Programs with Few Queries Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) COMP2017-47 |
We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables... [more] | COMP2017-47 p.17 |
| COMP | 2018-03-05 13:20 |
Osaka | Osaka Prefecture Univ. | [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) COMP2017-48 |
[more] | COMP2017-48 p.19 |
| COMP | 2018-03-05 14:25 |
Osaka | Osaka Prefecture Univ. | Analysis of Polynomial-time Learnability with Membership Queries Mikito Nanashima (Tokyo Inst. of Tech.) COMP2017-49 |
We investigate the polynomial-time learnability by using examples and membership queries. Angluin and Kharitonov proved ... [more] | COMP2017-49 pp.21-26 |
| COMP | 2018-03-05 14:50 |
Osaka | Osaka Prefecture Univ. | A recognition algorithm for simple-triangle graphs Asahi Takaoka (Kanagawa Univ.) COMP2017-50 |
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an i... [more] | COMP2017-50 pp.27-34 |
| COMP | 2018-03-05 15:30 |
Osaka | Osaka Prefecture Univ. | 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) COMP2017-51 |
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] | COMP2017-51 pp.35-42 |
| COMP | 2018-03-05 15:55 |
Osaka | Osaka Prefecture Univ. | 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.) COMP2017-52 |
In recent years, the necessity of analyzing big data is increasing to utilize them. In such cases, sublinear-time algori... [more] | COMP2017-52 pp.43-50 |
| COMP | 2018-03-05 16:20 |
Osaka | Osaka Prefecture Univ. | On Settlement Fund Circulation Problem Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.) COMP2017-53 |
[more] | COMP2017-53 pp.51-58 |
[Return to Top Page]