Regular seminars

Applied Mathematical Logic Seminar
- Amanda Vidal (ICS CAS): Axiomatic systems of Gödel Modal Logics
  11.12.2019 16:00Room: 318 @ Institute of Computer Science
  In this seminar we will go over the main results from the literature concerning Gödel modal logics, understood as the logics arising from prominent distinguished classes of Kripke models valued over the standard Gödel algebra. Known results cover axiomatizing the the box and the diamond fragments of the logic both over the most general class of valued models (MG), and over the ones where the underlying frame is classical, and the logic with both modal operators over the class MG. We will then approach the problem of axiomatizing the bi-modal logic over the class of models with underlying classical frames, and propose an axiomatization relying in Dunn's axiom of positive modal logic. We will see some consequences that arise from the technical details of the completeness proof, and if time allows, the relation of these logics with some modal Intuitionistic logics from the literature.
Hora Informaticae
- RNDr. Jan Kalina, Ph.D.: How to deal with data contamination in hypothesis testing
  16.12.2019 14:00Room: 318 @ Institute of Computer Science
  The theory of testing statistical hypotheses aims not only at proposing suitable tests, but also (and mainly) at deriving their optimal procedures under certain conditions. Any type of data contamination however requires non-standard approaches to testing. This talk, which is intended for non-statisticians, will very briefly overview principles of several recent results, on which I participated. To be specific, particular results include: Minimax tests under measurement errors, Locally optimal tests based on sequential ranks, Tests based on ranks of interpoint distances among high-dimensional observations, Symmetry tests based on robust multivariate estimators.
ISCB Seminar

Lectures for selection process of "Tenure track positions in Computer Science and in Artificial Intelligence".

Tenure Track Talks

Other Relevant Seminars

Computational Methods Seminar
Machine Learning Seminar
Graph Theory Seminar
- Simón Piga (Universität Hamburg): Localised codegree conditions for Hamilton cycles in hypergraphs
  06.12.2019 10:00Room: 318 @ Institute of Computer Science
  We study sufficient conditions for the existence of Hamiltonian cycles in uniformly dense $3$-uniform hypergraphs. Problems of this type were first considered by Lenz, Mubayi, and Mycroft for loose Hamiltonian cycles and Aigner-Horev and Levy considered it for tight Hamiltonian cycles for a fairly strong notion of uniformly dense hypergraphs. We focus on tight cycles and obtain optimal results for a weaker notion of uniformly dense hypergraphs. We show that if an $n$-vertex $3$-uniform hypergraph $H=(V,E)$ has the property that for any set of vertices $X$ and for any collection $P$ of pairs of vertices, the number of hyperedges composed by a pair belonging to $P$ and one vertex from $X$ is at least $(1/4+o(1))|X||P| - o(|V|^3)$ and $H$ has minimum vertex degree at least $\Omega(|V|^2)$, then $H$ contains a tight Hamiltonian cycle. A probabilistic construction shows that the constant $1/4$ is optimal in this context.
The Karel Čapek Centre for Values in Science and Technology

Regular seminars

Lectures for selection process of "Tenure track positions in Computer Science and in Artificial Intelligence".

Other Relevant Seminars

MEDARD - weather report

CONTACT