Program
The Workshop will take place at the main building of the University of Latvia, Raina Bulvaris 19.
Note that the time for a presentation is 30 minutes and 15 minutes are scheduked for discussion.
| 9:00 - 9:10 |
Opening
(Thomas Zeugmann) |
| 9:15 - 10:00 |
On the hardness of approximating the minimum
consistent DFA from prefix samples
Kaori Ueno, Shinichi Shimozono, Kazuyuki Narisawa, and Ayumi Shinohara |
| 10:00 - 10:45 |
Learning Programs as Logical Queries
Charles Jordan and Łukasz Kaiser |
| 10:45 - 11:30 |
Combinatorial Online Prediction via Metarounding
Takahiro Fujita, Kohei Hatano, and Eiji Takimoto |
| 11:30 - 13:30 | Lunch Break |
| 13:30 - 14:30 |
Invited Lecture
Circuit Lower Bounds from Learning-Theoretic Approaches Akinori Kawachi |
| 14:30 - 15:00 | Coffee Break |
| 15:00 - 15:45 |
Passive and Active Testing of Linear Functions Over the Boolean Hypercube
Abbas Mehrabian |
| 15:45 - 16:30 |
New Polynomial Bounds for the Identification in
the Limit Paradigm using Generative Grammars
Rémi Eyraud and Jeffrey Heinz |
| 16:30 - 17:15 |
Stochastic Finite Learning of Some Mildly Context-Sensitive Languages
John Case, Ryo Yoshinaka, and Thomas Zeugmann |
©Copyright Notice:
The documents of this page are subject to copyright. All rights are reserved,
whether the whole or part of the material is concerned, specifically the
rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other way, and storage
in data banks. Duplication of these publication or parts thereof is permitted
only under the provision of the corresponding copyright laws of the author's
country, and permission for use must always be obtained
from the corresponding authors. Violations are liable for prosecution under
the corresponding copyright law.
Last update July 4, 2013
