ken-system: Advance Program - 2020-05-COMP-IPSJ-AL

IEICE Technical Committee Submission System
Advance Program

Online Proceedings
[Sign in]
Tech. Rep. Archives

===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Toshihiro Fujito (Toyohashi Univ. of Tech.) Vice Chair: Shinichi Nakano (Gunma Univ.)
Secretary: Yota Otachi (Nagoya Univ), Suguru Tamaki (Univ. of Hyogo)
Assistant: Kazuhisa Seto (Seikei Univ.)

===============================================
Special Interest Group on Algorithms (IPSJ-AL)

DATE:
Sat, May 9, 2020 09:30 - 17:28

PLACE:
Online

TOPICS:

----------------------------------------
Sat, May 9 AM (09:30 - 12:00)
----------------------------------------

(1)/COMP 09:30 - 09:55
On Power and limitation of adversarial example attacks
Kouichi Sakurai (Kyushu Univ.)

(2) 09:55 - 10:15
[AL] [ショートトーク] クラスタリングにより知識の局所的一貫性を確保するブール多値論理推論
○野崎裕人，リンジンズゥ，鈴木寿（中央大学）

(3) 10:15 - 10:35
[AL] [ショートトーク] 小規模回路で実現する高速多倍長乗算方式のシミュレーション
○久田大貴，リンジンズゥ，鈴木寿（中央大学）

(4) 10:35 - 11:00
[AL177振替] Better Embedding of k-Outerplanar Graphs into Random Trees
○松林昭（金沢大）

----- Break ( 15 min. ) -----

(5) 11:15 - 12:00
[AL] [招待講演] A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation
○Mitsuru Kusumoto (Preferred Networks)，Takuya Inoue (The University of
Tokyo), Gentaro Watanabe, Takuya Akiba, Masanori Koyama (Preferred
Networks)

----- Lunch Break ( 90 min. ) -----

----------------------------------------
Sat, May 9 PM (13:30 - 17:28)
----------------------------------------

(6) 13:30 - 14:30
[COMP] [招待講演] The Directed Flat Wall Theorem
○河原林健一（NII）

----- Break ( 15 min. ) -----

(7) 14:45 - 15:10
[AL] M凸関数最小化問題に対する最急降下法の厳密な反復回数
○南川智都，塩浦昭義（東京工業大学）

(8)/COMP 15:10 - 15:35
Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES
Etsuji Tomita (Univ. Electro-Comm.), Alessio Conte (Univ. of Pisa)

(9) 15:35 - 16:00
[AL177振替] 四つ組の非推移的サイコロの混合戦略
○盧尚，来嶋秀治（九州大学）

----- Break ( 15 min. ) -----

(10)/COMP 16:15 - 16:40
Gathering for mobile agents with a strong team in weakly Byzantine environments
Jion Hirose, Masashi Tsuchida (NAIST), Junya Nakamura (TUT), Fukuhito Ooshita, Michiko Inoue (NAIST)

(11) 16:40 - 17:05
[AL177振替] Approximation of the Independent Feedback Vertex Set Problem
○Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku University)

(12) 17:05 - 17:25
[AL] [ショートトーク]パス幅３以下でダイヤモンド自由なグラフの３彩色可能性
○島崎浩幸，玉木久夫（明治大学）

----- Closing ( 1 min. ) -----

(13)/COMP 17:26 - 17:27
On Memory, Communication, and Synchronous Schedulers for Autonomous Mobile Robots
Paola Flocchini (UoO), Nicola Santoro (CU), Koichi Wada (HU)

(14)/COMP 17:27 - 17:28
A Packet Classification Algorithm via Decision Diagram Based on Run-Based Trie with Pointers
Takashi Harada, Shogo Takeuchi (Kochi Univ. Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.)

# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.

# CONFERENCE SPONSORS:
- This conference is co-sponsored by the Special Interest Group on Algorithms (SIGAL) of Information Processing Society of Japan (IPSJ)

=== Technical Committee on Theoretical Foundations of Computing (COMP) ===

# SECRETARY:
Yota Otachi
Graduate School of Informatics, Nagoya University
Address: Furo-cho, Chikusa-ward, Nagoya-City, 464-8601, Japan
E-mail: o