UNIVERZITA KOMENSKÉHO V BRATISLAVA / SLOVENSKÁ REPUBLIKA FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY KATEDRA POČÍTAČOVEJ GRAFIKY A SPRACOVANIA OBRAZU Tentative Correspondence estimation in Wide Baseline Stereo

UNIVERZITA KOMENSKÉHO V BRATISLAVE FAKULTA MATEMATIKY, FYZIKY A INFORMATIKY Katedra algebry, geometrie a didaktiky matematiky HEREDITY, HEREDITARY COREFLECTIVE HULLS AND OTHER PROPERTIES OF COREFLECTIVE SUBCATEGORIES OF CATEGORIES OF TOPOLOGICAL SPACES

This thesis deals mainly with hereditary coreflective subcategories of the category Top of topological spaces. After preparing the basic tools used in the rest of thesis we start by a question which coreflective subcategories of Top have the property SA = Top (i.e., every topological space can be embedded in a space from A). We characterize such classes by finding generators of the smallest cor...

Univerzita Karlova v Praze Přírodovědecká fakulta Katedra fyziologie rostlin Symbiotické vlastnosti a ekofyziologický význam hub agregátu Rhizoscyphus ericae pro hostitelské rostliny

Charles University in Prague Faculty of Mathematics and Physics Constraint - based Timetabling

Univerzita Karlova v Praze Matematicko-fyzikální fakulta Rozvrhování s omezujícími podmínkami Autoreferát doktorandské disertační práce k získání akademicko-vědeckého titulu doktor. Disertační práce byla vypracována v rámci doktorandského studia, které uchazeč absolvoval na katedře teoretické informatiky Univerzity Karlovy v letech 2001-2005.-1

Slovenská Technická Univerzita V Bratislave Fakulta Informatiky a Informačných Technológií

The information overloading is one of the biggest problems nowadays. We can see it in various domains, including business, especially in the news. This is more significant in connection to news portals, where the quality of the news portal is commonly measured by amount of news added to the site. Then the most renowned news portals add hundreds of new articles daily. The classical solution usua...

Claw-free and Generalized Bull-free Graphs of Large Diameter Are Hamiltonian Zden Ek Ryjj a Cek Katedra Matematiky Zz Apado Ceskk a Univerzita Univerzitn 22 306 14 Plze N Czech Republic

A generalized (i; j)-bull B i;j is a graph obtained by identifying each of some two distinct vertices of a triangle with an endvertex of one of two vertex-disjoint paths of lengths i; j. We prove that every 2-connected claw-free B 2;j-free graph of diameter at least maxf7; 2jg (j 2) is hamiltonian.