Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2020-03-01 10:00 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Algorithms for uniform deployment of mobile agents in dynamic rings Masahiro Shibata (Kyutech), Yuichi Sudo (Osaka Univ.), Junya Nakamura (Toyohashi Tech), Yonghwan Kim (NITech) COMP2019-45 |
[more] |
COMP2019-45 pp.1-8 |
COMP |
2020-03-01 10:25 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
On a Filling Algorithm for an Autonomous Mobile Pair-Robot System in SSYNC Scheduler Yamada Ryoto, Yonghwan Kim, Yoshiaki Katayama (Nagoya Inst. of Tech.) COMP2019-46 |
Autonomous mobile robot system is a distributed system consisting of autonomous mobile robots which operate in Look-Comp... [more] |
COMP2019-46 pp.9-16 |
COMP |
2020-03-01 10:50 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Creating an Apple Watch sales forecasting system that analyzes Twitter Yoshiaki Yagi, Mitsuhiro Iyoda (CIT) COMP2019-47 |
Abstract In the investigation, I will use Twitter tweets to predict sales based on emotions and demonstrate how importan... [more] |
COMP2019-47 pp.17-21 |
COMP |
2020-03-01 11:30 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga (Chuo Univ.) COMP2019-48 |
The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] |
COMP2019-48 p.23 |
COMP |
2020-03-01 14:00 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Metric Dimension on Some Classes of Chordal Graphs Ryoga Katoh, Remy Belmonte (UEC) COMP2019-49 |
The METRIC DIMENSION problem asks, given a graph $G$ and integer $k$, whether there exists a set $S$ of vertices of size... [more] |
COMP2019-49 pp.25-28 |
COMP |
2020-03-01 14:25 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
On Approximation Algorithms for Power Vertex Cover Problem Takumi Tatematsu, Tetsuro Rintani, Toshihiro Fujito (TUT) COMP2019-50 |
We present two 2-approximation algorithms for Power Vertex Cover problem, which is a generalization of
the Vertex Cover... [more] |
COMP2019-50 pp.29-33 |
COMP |
2020-03-01 14:50 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Minmax regret 1-sink problem with parametric weights Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) COMP2019-51 |
This paper addresses the minmax regret 1-sink problem in dynamic path networks with parametric weights. A dynamic path n... [more] |
COMP2019-51 pp.35-41 |
COMP |
2020-03-01 15:15 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Efficient algorithm for simulating an unbiased coin tossing with a baiased coin Koji Ueno, Ryuhei Uehara (JAIST) COMP2019-52 |
(To be available after the conference date) [more] |
COMP2019-52 pp.43-49 |
COMP |
2020-03-01 16:00 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Information theoretic lower bound of Hasse diagrams with degree constraint Jumpei Mori, Jun Kawahara, Shinichi Minato (Kyoto Univ.) COMP2019-53 |
[more] |
COMP2019-53 pp.51-56 |
COMP |
2020-03-01 16:25 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Synchronizing Pushdown Automata and Reset Words Eitatsu Mikami, Tomoyuki Yamakami (Univ. Fukui) COMP2019-54 |
[more] |
COMP2019-54 pp.57-63 |
COMP |
2020-03-01 16:50 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Online Learning for A Repeated Markovian Game with 2 States Shangtong Wang, Shuji Kijima (Kyushu Univ.) COMP2019-55 |
We consider a new problem of learning in repeated games. In our model, the players play on one of the several game matri... [more] |
COMP2019-55 pp.65-68 |
COMP |
2020-03-01 17:15 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning Mikito Nanashima (Tokyo Tech) COMP2019-56 |
[more] |
COMP2019-56 pp.69-76 |