8月3日(月) | 8月4日(火) |
10:00 秋葉 拓哉
Efficient Top-k Shortest-path Distance Queries on Large Networks by Pruned Landmark (AAAI’15)
10:25 波多野 大督
Lagrangian Decomposition Algorithm for Allocating Marketing Channels (AAAI’15)
10:50 吉田 悠一
Distributed Multiplicative Weights Methods for DCOP (AAAI’15)
11:15 – 11:30 ブレイク
11:30 Marcel Roeloffzen
A linear-time algorithm for the geodesic center of a simple polygon (SOCG’15)
11:55 高口 太朗
Sufficient conditions of endemic threshold on metapopulation networks
(Journal of Theoretical Biology)
12:20 – 13:45 ランチブレイク
13:45 佐藤 一誠
Stochastic Divergence Minimization for Online Collapsed Variational Bayes Zero Inference of Latent Dirichlet Allocation (KDD’15)
14:10 則 のぞみ
Simultaneous Modeling of Multiple Diseases for Mortality Prediction in Acute Hospital Care (KDD’15)
14:35 鈴木 大慈
Convergence rate of Bayesian tensor estimator and its minimax optimality (ICML’15)
15:00 – 15:15 ブレイク
15:15 平原 秀一
Identifying an Honest EXP^NP Oracle Among Many (CCC’15)
15:40 山口 勇太郎
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (ICALP’15)
16:05 小関 健太
Spanning closed walks and TSP in 3-connected planar graphs
(Journal of Combinatorial Theory, Series B 2014)
4-connected projective-planar graphs are Hamiltonian-connected
(Journal of Combinatorial Theory, Series B 2015)
16:30 河原林 健一
Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (STOC’15)
The Directed Grid Theorem (STOC’15)
Beyond the Euler Characteristic: Approximating the Genus of General Graphs (STOC’15)