Kvalifikační práce
Procházet dle
Poslední příspěvky
Zobrazují se záznamy 1-10 z 10676
-
Computer Modelling of Plasma Processes andTransport for Selected Applications
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2009)Datum obhajoby: 17. 12. 2009 -
Proof Complexity of CSP
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 20. 2. 2024In this thesis we formalize Zhuk's decision algorithm solving in p-time tractable con- straint satisfaction problems (CSPs) in a weak theory of bounded arithmetic W1 1 . As a consequence, we show that tautologies that ... -
Laboratory studies of reactions of O+ and N+ ions with molecular hydrogen and its isotopologues, HD and D2, at low temperatures
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2021)Datum obhajoby: 12. 3. 2021This work is focused on the laboratory studies of reactions of O+ and N+ ions with molecular hydrogen and its isotopologues, HD (hydrogen deuteride) and D2. The experimental studies were performed using a 22-pole radiofrequency ... -
Two-phase scheduling with unknown speeds
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 16. 2. 2024Speed-robust scheduling is a two-stage scheduling problem with a makespan objective. We are given processing times of n jobs, number of machines m and number of bags b. We have to group the jobs into bags that are to be ... -
Distance magic labelings
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 16. 2. 2024Title: Distance Magic Labelings Author: Hayden Pfeiffer Department: Dept. of Theoretical Computer Science and Mathematical Logic Supervisor: doc. Mgr. Petr Gregor, Ph.D., KTIML, MFF UK Abstract: A distance magic labeling ... -
Structure and complexity of homomorphisms
Výsledek obhajoby: UZNÁNO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 4. 3. 2024This thesis is concerned with computational complexity aspects of graph homomorph- isms and related concepts. We are mainly interested in various polynomial time versus NP-complete dichotomies. These results are especially ... -
Precision measurement of neutrino oscillations parameters
Výsledek obhajoby: UZNÁNO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 4. 3. 2024The Daya Bay Reactor Neutrino Experiment, located in Southeast China, was de- signed to measure short baseline oscillation of electron antineutrinos originating from six 2.9 GWth nuclear reactors. In 2012, it discovered ... -
Základy fungování internetu - didaktické materiály pro 2. stupeň ZŠ
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 15. 2. 2024The Framework Educational Programme was revised in the Czech Republic in 2021 to include the basic principles of the Internet and computer networks in teaching computer science at ISCED level 2. According to the new revision, ... -
6D pose estimation of objects in images
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 14. 2. 2024The 6D pose estimation is an important computer vision task with applications in robotics, e.g. for manipulation or grasping, but also in computer graphics and augmented reality. Given an image, the task is to estimate the ... -
Reprezentační neuronové sítě pro diferencovatelné renderování objemu
Výsledek obhajoby: OBHÁJENO(Univerzita Karlova, Matematicko-fyzikální fakulta, 2024)Datum obhajoby: 14. 2. 2024This thesis investigates the possibility of using a representation neural network as a data structure for an appearance prediction model. We present the representation network as an adaptation of the popular neural radiance ...