| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2014)
Search Results: Keywords 'from:2014-12-05 to:2014-12-05'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2014-12-05 10:00 |
Kumamoto | Sojo University | A Nonuniform Circuit Class with Multi Layers of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds against NEXP Kazuyuki Amano, Atsushi Saito (Gunma Univ.)  COMP2014-32 |
[more] | COMP2014-32 pp.1-8 |
| COMP | 2014-12-05 10:30 |
Kumamoto | Sojo University | Energy Optimization in Speed Scaling Models via Submodular Optimization Akiyoshi Shioura (Tohoku Univ.), Natalia V. Shakhlevich (Univ. of Leeds), Vitaly A. Strusevich (Univ. of Greenwich) COMP2014-33 |
[more] | COMP2014-33 pp.9-16 |
| COMP | 2014-12-05 11:00 |
Kumamoto | Sojo University | On Zero-Suppressed Binary Decision Diagrams and Complexity Theory Hiroki Morizumi (Shimane Univ.) COMP2014-34 |
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most... [more] | COMP2014-34 pp.17-19 |
| COMP | 2014-12-05 13:00 |
Kumamoto | Sojo University | [Invited Talk]
A new characterization of maximal repetitions by Lyndon trees Hideo Bannai (Kyushu Univ.), Tomohiro I (TU Dortmund), Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta (Kyushu Univ.) COMP2014-35 |
A run is a maximal periodic sub-interval of a string, that is at least as long as twice its smallest period. Runs are im... [more] | COMP2014-35 p.21 |
| COMP | 2014-12-05 13:55 |
Kumamoto | Sojo University | Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-36 |
In this paper, we investigate conditions to compute nonnegative integer combinations for a given set of positive integer... [more] | COMP2014-36 pp.23-27 |
| COMP | 2014-12-05 14:25 |
Kumamoto | Sojo University | Polynomial-time approximability of the 1-{sc Sink Location} problem in undirected graphs with triangular inequality Remy Belmonte, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.) |
[more] | |
| COMP | 2014-12-05 14:55 |
Kumamoto | Sojo University | On a Gathering Protocol for Five Fat Robots Takuya Hirano, Yoshiaki Katayama (NITech), Koichi Wada (HOSEI Univ.) COMP2014-37 |
In this paper, we propose a protocol for gathering problem with five mobile fat robots. Robots are anonymous, have no co... [more] | COMP2014-37 pp.29-36 |
| COMP | 2014-12-05 15:25 |
Kumamoto | Sojo University | Homomorphism-Substitutable Context-free Languages and Learning Algorithm Takayuki Kuriyama (Sokendai/ NII) COMP2014-38 |
We generalized the class of $k,l$-substitutable languages (Yoshinala, 2008). Each language in the generalized class is c... [more] | COMP2014-38 pp.37-44 |
| COMP | 2014-12-05 16:10 |
Kumamoto | Sojo University | Optimally Bracing Frameworks of Union of Space-filling Convex Polyhedra Yuki Kobayashi, Yoshihiko Ito, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Jin-ichi Itoh (Kumamoto Univ.), Chie Nara (Tokai Univ.) COMP2014-39 |
(To be available after the conference date) [more] | COMP2014-39 pp.45-51 |
| COMP | 2014-12-05 16:40 |
Kumamoto | Sojo University | A Fast Algorithm for Sphere Packings and its Applications Shuji Yamada (Kyoto Sangyo Univ.), Jinko Kanno (LaTech), Miki Miyauchi (NTT) COMP2014-40 |
[more] | COMP2014-40 pp.53-58 |
| COMP | 2014-12-05 17:10 |
Kumamoto | Sojo University | Optimally Bracing Grid Frameworks with Holes Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh (Kyoto Univ.), Sheung-Hung Poon (National Tsing Hua Univ.), Maria Saumell (Univ. of West Bohemia) COMP2014-41 |
[more] | COMP2014-41 pp.59-63 |
[Return to Top Page]