===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Koichi Wada (Hosei Univ.) Vice Chair: Toshimitsu Masuzawa (Osaka Univ.)
Secretary: Sayaka Kamei (Hiroshima Univ.), Hisashi Koga (Univ. of Electro-Comm.)
===============================================
Special Interest Group on Algorithms (IPSJ-AL)
DATE:
Fri, Jun 12, 2015 13:05 - 18:05
Sat, Jun 13, 2015 08:30 - 15:35
PLACE:
(石井利昌先生, 喜田 拓也先生)
TOPICS:
----------------------------------------
Fri, Jun 12 PM (13:00 - 18:05)
----------------------------------------
(1) 13:05 - 13:30
(2) 13:30 - 13:55
(3) 13:55 - 14:20
(4) 14:20 - 14:45
----- Break ( 10 min. ) -----
(5)/COMP 14:55 - 15:55
[Invited Talk]
Recent Advances in Theory of Combinatorial Rigidity and Its Applications
Naoki Katoh (KGU)
----- Break ( 10 min. ) -----
(6)/COMP 16:05 - 16:30
A 3+Omega(1) Lower Bound for Page Migration
Akira Matsubayashi (Kanazawa Univ.)
(7) 16:30 - 16:50
(8) 16:50 - 17:15
(9)/COMP 17:15 - 17:40
A design of real coded genetic algorithm processor
Akihiko Tsukahara, Akinori Kanasugi (Tokyo Denki Univ.)
(10)/COMP 17:40 - 18:05
An FPGA Implementation of Correlation Processor
Yuma Matsui, Akihiko Tsukahara, Akinori Kanasugi, Ki Ando (Tokyo Denki Univ.)
----------------------------------------
Sat, Jun 13 AM (08:30 - 15:35)
----------------------------------------
(11)/COMP 08:30 - 08:55
Fast Search Method for Moat Problems on Prime Elements in Imaginary Quadratic Fields
Shinji Kinoshita, Hajime Matsui (TTI)
(12) 08:55 - 09:20
(13) 09:20 - 09:45
(14) 09:45 - 10:05
----- Break ( 10 min. ) -----
(15) 10:15 - 10:40
(16) 10:40 - 11:05
(17)/COMP 11:05 - 11:30
An Algorithm for Uniform Deployment of Mobile agents in Asynchronous Rings
Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.)
(18)/COMP 11:30 - 11:55
On a Self-Stabilizing Algorithm for constructing a (1, 1)-Maximal Directed Acyclic Graph Using st-ordering
Haruka Ono, Yoshiaki Katayama (NIT), Toshimitsu Masuzawa (OU)
----- Break ( 75 min. ) -----
(19) 13:10 - 14:10
----- Break ( 10 min. ) -----
(20)/COMP 14:20 - 14:45
On an Extension of Ukkonen's Online Suffix tree construction algorithm to Multi-Stream texts
Takuya Takagi, Hiroki Arimura (Hokkaido Univ.)
(21)/COMP 14:45 - 15:10
Efficient Approximate Pattern Matching Algorithm for Trajectory Data
Hirohito Sasakawa, Hiroki Arimura (Hokkaido Univ.)
(22)/COMP 15:10 - 15:35
Double-array Representation with String Labels
Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe (Tokushima Univ.)
# Information for speakers
General Talk will have 20 minutes for presentation and 5 minutes for discussion.
General Talk (ショート) will have 15 minutes for presentation and 5 minutes for discussion.
Invited Talk will have 50 minutes for presentation and 10 minutes for discussion.
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Tue, Sep 1, 2015: [Wed, Jun 17]
# SECRETARY:
Hisashi Koga
Graduate School of Information Systems,
University of Electro-Communications,
1-5-1 Chofugaoka, Chofu,
Tokyo 182-8585, Japan
E-mail: isc
=== Special Interest Group on Algorithms (IPSJ-AL) ===
Last modified: 2015-05-12 09:58:50
|
Notification: Mail addresses are partially hidden against SPAM.
|