> Top >> Program (this page)
WAAC 2015
August 21-22, 2015
August 21-22, 2015
Program (tentative)
Each talk should be 25 mins long, including Q/A and discussion.
The program below is tentative and may be changed by any reason.
Day 1: 21st August
| 09:00 - 09:50 | Registration |
| 09:50 - 10:00 | Opening |
| 10:00 - 11:40 | Session I |
|
Wu-Manber and Karp-Rabin Algorithms for Extended Matching Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim and Kunsoo Park |
|
|
Experiments on NFA Reductions for Fast Regular Expression Matching Sang-Ki Ko and Yo-Sub Han |
|
|
Extended Complexity of Lower-Truncated Transversal Polymatroids Shuichi Hirahara, Hidefumi Hiraishi and Hiroshi Imai | |
|
Grammar-based Compression of XML Data with Normalized Regular Hedge Grammar Guen-Hae Kim, Sang-Ki Ko and Yo-Sub Han | |
| 11:40 - 13:20 | Lunch (at Songdo Convensia) |
| 13:20 - 14:20 | Invited Talk |
|
Towards believable experiences from stationary geometries Speaker: HyungSeok Kim, Professor, Ph. D. |
|
| 14:20 - 14:40 | Coffee break |
| 14:40 - 15:55 | Session II |
|
The 2-center problem in a simple polygon Eunjin Oh, Jean-Lou De Carufel and Hee-Kap Ahn |
|
|
A Middle Curve Based on Discrete Fréchet Distance Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf and Carola Wenk |
|
|
Convex Configurations of Dissection Puzzles with Seven Pieces Kazuho Katsumata and Ryuhei Uehara | |
| 15:55 - 16:15 | Coffee break |
| 16:15 - 17:30 | Session III |
|
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs Akitoshi Kawamura and Martin Ziegler | |
|
Unit-Cost Buyback Problem with Matching-Weight Valuation Function Shun Fukuda, Akiyoshi Shioura and Takeshi Tokuyama | |
|
A Reliable Top-k Dominating Query on Uncertain Big Database Xiang Yu, Jinhee Chun and Takeshi Tokuyama |
|
| 18:00 - | Banquet |
|
Hanyang at Songdo Hanok Village |
Day 2: 22nd August
| 10:30 - 11:45 | Session IV |
|
Finding Largest Common Point Sets Juyoung Yon, Siu-Wing Cheng, Otfried Cheong and Antoine Vigneron | |
|
Ls in L and Sphinxes in Sphinx Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara |
|
|
Approximate matching for Go board positions Alonso GRAGERA |
|
| 11:45 - 11:50 | Closing |
END of WAAC2015
-
Juyoung Yon, Siu-Wing Cheng, Otfried Cheong and Antoine Vigneron
Finding Largest Common Point Sets -
Akitoshi Kawamura and Martin Ziegler
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs -
Kazuho Katsumata and Ryuhei Uehara
Convex Configurations of Dissection Puzzles with Seven Pieces -
Xiang Yu, Jinhee Chun and Takeshi Tokuyama
A Reliable Top-k Dominating Query on Uncertain Big Database -
Shun Fukuda, Akiyoshi Shioura and Takeshi Tokuyama
Unit-Cost Buyback Problem with Matching-Weight Valuation Function -
Myoungji Han, Munseong Kang, Sukhyeun Cho, Geonmo Gu, Jeong Seop Sim and Kunsoo Park
Wu-Manber and Karp-Rabin Algorithms for Extended Matching -
Eunjin Oh, Jean-Lou De Carufel and Hee-Kap Ahn
The 2-center problem in a simple polygon -
Hee-Kap Ahn, Helmut Alt, Maike Buchin, Eunjin Oh, Ludmila Scharf and Carola Wenk
A Middle Curve Based on Discrete Fréchet Distance -
Takashi Horiyama, Yoshio Okamoto and Ryuhei Uehara
Ls in L and Sphinxes in Sphinx -
Sang-Ki Ko and Yo-Sub Han
Experiments on NFA Reductions for Fast Regular Expression Matching -
Shuichi Hirahara, Hidefumi Hiraishi and Hiroshi Imai
Extended Complexity of Lower-Truncated Transversal Polymatroids -
Alonso GRAGERA
Approximate matching for Go board positions -
Guen-Hae Kim, Sang-Ki Ko and Yo-Sub Han
Grammar-based Compression of XML Data with Normalized Regular Hedge Grammar