Program

Thursday 15.9.2016

Main track

19:55 - 20:00 - Conference opening
20:00 - 20:30 - Miroslav Kratochvíl: Compiling Functional Code for System-Level Environment
20:30 - 21:00 - Martin Macko, Martin Králik, Broňa Brejová, Tomáš Vinař: OB-Fold Recognition Combining Sequence and Structural Motifs

Main track

19:00 - 20:00 - Michal Valko: Sequential Learning on Graphs with Limited Feedback (invited lecture)

20:00 - 20:15 - Coffee break

WASACNA

20:15-20:35 Martin Nehéz: On Some Combinatorial Properties of Random 2-Dimensional Tori
20:35-20:55 Dušan Bernát: On the Mean Value of Domination Number of Random Regular Graphs
20:55-21:15 Problem Session

WASACNA

9:00-10:00 Ľuboš Buzna: Equitable Distribution of Scarce Resources in Transportation Networks (invited lecture, WASACNA)

10:00-10:30 Coffee break

10:30-10:50 Radek Mařík : On Large Genealogical Graph Layouts
10:50-11:10 Jana Coroničová Hurajová, Tomáš Madaras: Revising the Newman-Girvan Algorithm
11:10-11:30 Jitka Doležalová, Stanislav Popelka: The Use of Simple Graphs and Cliques for Analysis of Cartographic Eye-Tracking Data
11:30-11:50 Andrej Jursa: Fast Algorithm for Finding Maximum Clique in Scale-Free Networks
11:50-12:10 Mária Markošová: Dynamic Model of Functional Brain Networks
12:10-12:30 Martin Nehéz, Júlia Kožíková: Toward Fast Computation of Proteomic Parsimony via Bipartite Graphs

WCIDM

10:30-11:00 Nikola Jajcay: Statistical modelling in climate science
11:00-11:30 Jakub Repický: Traditional Gaussian Process Surrogates in the BBOB Framework
11:30-12:00 Tomáš Borovička: Early Failure Detection for Predictive Maintenance of Sensor Parts
12:00-12:30 Tomáš Šabata: Modeling and Clustering the Behavior of Animals using Hidden Markov Models

AAFSPACS

10:30-10:55 Róbert Jajcay: Inverse Semigroups of Partial Automorphisms of Graphs
11:00-11:25 Oleg Gutik: On the Group of Automorphisms of the Brandt Lambda0-Extension of a Monoid With Zero
11:30-11:55 Otokar Grošek: Semigroups in Cryptography
12:00-12:25 Mária B. Szendrei: On Products of Inverse Semigroups

12:30-14:00 - Lunch break

15:00-15:30 Coffee Break

15:30-15:55 Emanuele Rodaro: Decidability vs Undecidability of the Word Problem in HNN-Extensions of Inverse Semigroups
16:00-16:25 Tatiana Jajcayová: The Word Problem in Free Inverse Monoids

SloNLP

17:45-18:45 Jiří Materna: Aplikace strojového učení ve fulltextovém vyhledávání (invited lecture)

19:00 - Banquet

SloNLP

8:55-9:00 Úvodní slovo (Rudolf Rosa)
9:00-9:20 Ladislav Lenc, Tomas Hercig: Neural Networks for Sentiment Analysis in Czech
9:20-9:40 Ondřej Plátek, Petr Bělohlávek, Vojtěch Hudeček, Filip Jurčíček: Recurrent Neural Networks for Dialog State Tracking
9:40-10:00 Tomáš Jelínek: Error rates and agreements of parsers: two experiments with ensemble parsing of Czech
10:00-10:20 David Mareček: 12 years of Unsupervised Dependency Parsing
10:20-10:30 Jaroslava Hlaváčová: Kolik potřebujeme slovních druhů?

10:30-11:00 Coffee break

11:00-11:20 Josef Chaloupka: Automatic Symbol Processing for Language Model Building in Slavic Languages
11:20-11:40 Katrin Přikrylová, Vladislav Kuboň, Kateřina Veselovská: Logical vs. Natural Language Conjunctions in Czech: A Comparative Study
11:40-12:00 Alexandr Rosen: Building and using corpora of non-native Czech
12:00-12:20 Rudolf Rosa: Czechizator - Čechizátor
12:20-12:30 László Kovács, Erika Baksa-Varga, Daniel Hládek: Lexicon-based Post Correction of OCR Errors

WCIDM

9:00-9:30 Jan Outrata, Martin Trnečka: Evaluating Association Rules in Boolean Matrix Factorization
9:30-10:00 Pavel Milička, Petr Čížek: On Chaotic Oscillator-based Central Pattern Generator for Motion Control of Hexapod Walking Robot
10:00-10:30 Petra Vidnerová: Vulnerability of machine learning models to adversarial examples

10:30-11:00 Coffee break

11:00-11:30 Petr Pulc: Image Processing in Collaborative Open Narrative Systems
11:30-12:00 Otakar Trunda, Robert Brunetto: Fitness landscape analysis of hyper-heuristic transforms for the vertex cover problem
12:00-12:30 Martin Kopp: How to Mimic Humans, Guide for Computers

Main track

17:00-17:30 Martin Plátek, Karel Oliva: Redukční analýza A-stromů s minimalistickými omezeními
17:30-18:00 Vladislav Kuboň, Markéta Lopatková, Tomáš Hercig: Searching for a Measure of Word Order Freedom

WCIDM

19:00-19:30 Věra Kůrková: Multivariable Approximation by Convolutional Kernel Networks
19:30-20:00 Hans Degroote: Reinforcement Learning for Automatic Online Algorithm Selection - an Empirical Study
20:00-20:30 Nikita Orekhov: Testing Gaussian Process Surrogates on CEC'2013 multi-modal benchmark

20:45 Closing remarks, best paper award