VaV na FI

Scientific Research and Development

Not only do we teach computer science, we push the boundaries of knowledge forward

How to recognize a good faculty? It does top science. Just like we do at FI.

What is our recipe for premium results?

Research Groups

We focus on selected research topics and projects

Excellent Publications

We are one of the top Czech institutions

Links to Industry

We can do basic research and apply the results in practice

Doctoral Programme

We are constantly seeking and providing support for smart students

Research Areas Research Projects

Lectures, Informatics Colloquia, and News

  • Tuesday

    25 Feb

    Informatics Colloquium 25.2. Energy-efficient neural networks for embedded systems

    Informatics Colloquium 25.2. 2019, 14:00 lecture hall D2 Ing. Vojtěch Mrázek, Ph.D., FIT VUT Energy-efficient neural networks for embedded systems Abstract: Artificial neural networks are optimized for high-performance computer systems. However, the inference path of the NNs is often executed in small embedded systems such as special ASIC or FPGA accelerators. Since these systems are typically battery-powered, the energy consumption becomes crucial. In this context, this talk deals with three topics. (i) Overview and challenges of hardware NN accelerators. (ii) Error resiliency of neural networks. (iii) Approximations of NN inference path for applications such as low power image classifiers.
    Read more

    From 2:00 PM

  • Tuesday

    3 Mar

    Informatics Colloquium 3.3. Kurt Gödel as a Destruction & Revival Theme

    Informatics Colloquium 3.3. 2019, 14:00 lecture hall D2 prof. RNDr. Jiří Zlatuška, CSc., FI MU Kurt Gödel as a Destruction & Revival Theme Abstract: Kurt Gödel's results can be viewed as a destruction of Formal Mathematics as a discipline dealing with mathematical truths, and at the same time as laying a foundation of subsequent revival of the field in the form of Informatics as a discipline dealing with the nature of computational side of the world (complementing the physical and consciousness sides dealt with in other branches of scientific disciplines). This talk is a slight extension of the talk given at the opening of the "Tribute to Kurt Gödel 2020" international conference which took place in Brno in January 2020.
    Read more

    From 2:00 PM

  • Wednesday

    4 Mar

    Seminar Series - Symmetry: From Conway’s Magic Theorem to Archimedes’ Labyrinth and Beyond

    Hans Munthe-Kaas is professor of mathematics at the University of Bergen. His research is centred around foundational questions in computational mathematics and applications of Lie groups, symmetries and differential geometry in structure preserving discretisations of differential equations. Munthe-Kaas is chair of the Abel prize committee, managing editor of the journal “Foundations of Computational Mathematics”, President of the Norwegian Mathematical Society, and President of the scientific council of Centre International de Mathématiques Pures at Appliquées (CIMPA) in Nice. Abstract Symmetry is a topic which has inspired artists and mathematicians from ancient to modern times. A fundamental problem is the classification of discrete groups of isometries, such as the 17 planar wallpaper groups, which have been used in mosaics since medieval ages and were classified by Fedorov in 1891 in a complicated proof. Conway’s Magic Formula can be used to classify discrete symmetries for spherical, plane and hyperbolic surfaces and yields the 17 wallpaper groups, the 7 frieze patterns and all discrete spherical symmetries as special cases. The formula and its proof is so simple that it is accessible to advanced high school students. Recently, Munthe-Kaas was involved in the design of a mathematical maze in Bergen Botanical garden. Inspired by Conway, he ended up with a highly symmetric design. Under some reasonable assumptions, only one of the 17 wallpaper groups fulfils his original design criteria. The labyrinth, called `Archimedes’ labyrint` consists of 1234 yews (Taxus baccata, Tis červený) in 2m height and covers an area of about 800 m^2. It was presented in Science Magazine, October 2018. In the last part of this talk we move beyond Conway, and discuss the problem of multivariate polynomial interpolation. Based on kaleidoscopic symmetry groups (Coxeter groups), we find interpolation points with remarkable properties. We show that for any d and k, there exists a unisolvent set of interpolation points for d-variate polynomial interpolation of order k. These points have optimal Lebesque constants and allow fast computation by symmetric fast Fourier transforms. Coffee Break at 4.00 PM The lecture starts at 4.30 PM, however, you can arrive earlier at 4 PM to attend an informal coffee break, during which you can engage in a discussion with the speaker himself and get first-hand knowledge. Where? Mendel Museum's Augustinian Abbey Refectory at Mendel Square
    Read more

    From 4:30 PM

News archive

"I'd like to thank our academics and students, particularly our doctoral students, for publishing work that has seen the Faculty of Informatics ranked first out of 55 institutions in the area in disciplinary comparisons published by IDEA CERGE in Oborová publikační výkonnost pracovišť výzkumných organizací v ČR v letech 2009-2013.

Jiří Zlatuška Prof. Jiří Zlatuška
FI MU Dean

Administrative Information

Office for Research & Development & Doctoral Programmes