Search for dissertations about: "Approximation algorithm"

Showing result 11 - 15 of 201 swedish dissertations containing the words Approximation algorithm.

  2. 11. Functional clustering methods and marital fertility modelling

    Author : Per Arnqvist; Sara Sjöstedt de Luna; Leif Nilsson; Helle Sørensen; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; censoring; Coale-Trussell model; EM-algorithm; functional data analysis; functional clustering; marital fertility; normal approximation; Poisson process; varved lake sediments; warping; Mathematical Statistics; matematisk statistik;

    Abstract : This thesis consists of two parts.The first part considers further development of a model used for marital fertility, the Coale-Trussell's fertility model, which is based on age-specific fertility rates. A new model is suggested using individual fertility data and a waiting time after pregnancies. READ MORE

  4. 12. Algorithmic Bounds for Presumably Hard Combinatorial Problems

    Author : Andreas Björklund; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; control; Datalogi; numerical analysis; systems; Computer science; Approximation algorithms; Exact algorithms; NP-hard problems; Algorithm theory; kontroll;

    Abstract : In this thesis we present new worst case computational bounds on algorithms for some of the most well-known NP-complete and #P-complete problems and their optimization variants. We consider graph problems like Longest Path, Maximum Cut, Number of Perfect Matchings, Chromatic and Domatic Number, as well as Maximum k-Satisfiability and Set Cover. READ MORE

  5. 13. Privacy Mechanism Design Through the Lens of Information Theory : With Applications to Compression, Caching, and Semantic Communication

    Author : Amirreza Zamani; Mikael Skoglund; Tobias J. Oechtering; Parastoo Sadeghi; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Privacy mechanism design; Leakage matrix; Strong privacy criterion; KL-divergence; Local approximation; Euclidean information geometry; Privacy-utility trade-off; χ2-privacy criterion; l1-privacy criterion; Common information; Functional representation lemma; Two-part construction coding; Design av sekretessmekanism; Läckagematris; Stark sekretesskriterium; KL-divergens; Lokal approximation; Euklidisk informationsgeometri; Sekretess-nyttoavvägning; χ2-sekretesskriterium; l1-sekretesskriterium; Gemensam information; Lemma för funktionell representation; Kodning med tvådelad konstruktion.; Electrical Engineering; Elektro- och systemteknik;

    Abstract : Privacy mechanism design is an important research area and is receiving increased attention in recent years. This field focuses on addressing the challenge of revealing general data that might have correlations with sensitive information, all while protecting this sensitive information against unauthorized access. READ MORE

  6. 14. Fast Microwave Tomography Algorithm for Breast Cancer Imaging

    Author : Samar Hosseinzadegan; Chalmers tekniska högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; breast cancer; computational cost; inverse problem; discrete dipole approximation; microwave tomography; forward solver; Jacobian matrix;

    Abstract : Microwave tomography has shown promise for breast cancer imaging. The microwaves are harmless to body tissues, which makes microwave tomography a safe adjuvant screening to mammography. READ MORE

  7. 15. Exact and approximation algorithms for graph problems with some biological applications

    Author : Eva-Marta Lundell; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Abstract : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. READ MORE