Sökning: "Approximation theory"

Visar resultat 1 - 5 av 230 avhandlingar innehållade orden Approximation theory.

  1. 1. Pointwise and Genomewide Significance Calculations in Gene Mapping through Nonparametric Linkage Analysis: Theory, Algorithms and Applications

    Detta är en avhandling från Centre for Mathematical Sciences, Lund University

    Författare :Lars Ängquist; Lunds universitet.; Lund University.; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; actuarial mathematics; programming; Statistik; cytogenetics; Genetik; cytogenetik; Mathematics; Matematik; Statistics; operations research; Genetics; ROC curves; conditioning loci; optimal score functions; noncentrality parameter; cost adjusted relative efficiency; exponential tilting; importance sampling; Monte Carlo simulation; normal approximation; crossover rate; process maximum; analytical approximation; significance calculations; NPL score; conditional linkage analysis; two-locus linkage analysis; Allele sharing; aktuariematematik; operationsanalys; programmering; gene-gene interaction; composite hypotheses; genetic disease models; classes of score functions; nonparametric linkage analysis;

    Sammanfattning : In linkage analysis or, in a wider sense, gene mapping one searches for disease loci along a genome. This is done by observing so called marker genotypes (alleles) and phenotypes (affecteds/unaffecteds) of a pedigree set, i.e. LÄS MER

  2. 2. Topics in Hardness of Approximation and Social Choice Theory

    Detta är en avhandling från Chalmers University of Technology

    Författare :Marcus Isaksson; Chalmers tekniska högskola Göteborgs universitet.; Chalmers tekniska högskola Göteborgs universitet.; Chalmers University of Technology University of Gothenburg.; [2010]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Teoretisk datalogi; Theoretical computer science; Hardness of approximation; social choice theory; Gibbard-Satterthwaite; max-q-cut; Condorcet voting; linear threshold functions.;

    Sammanfattning : .... LÄS MER

  3. 3. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Detta är en avhandling från Stockholm : Numerical Analysis and Computer Science (NADA), Stockholm University

    Författare :Cenny Wenner; Stockholms universitet.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; datalogi; Computer Science; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; Datalogi; Computer Science; CSP; Boolean Analysis; Satisfiability; SAT; Acyclic Subgraph; Betweenness; Unique Games;

    Sammanfattning : Kombinatoriska optimering inkluderar naturliga uppgifter såsom att hitta den snabbaste vägen till sitt arbetet, att schemalägga jobb hos specialister, eller att placera hållplatser för att minimera resenärers restid.Vi begränsar vi oss till de problem i vilket man ges en samling vilkor på variablermed målet att hitta en tilldelning av variablerna uppfyllandes så många som möjligt av vilkoren;så kallade Vilkorsuppfyllningsproblem (eng: Constraint Satisfaction Problems, CSPs). LÄS MER

  4. 4. Numerical analysis for random processes and fields and related design problems

    Detta är en avhandling från Umeå : Institutionen för matematik och matematisk statistik, Umeå universitet

    Författare :Konrad Abramowicz; Umeå universitet.; [2011]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; stochastic processes; random fields; approximation; numerical integration; Hermite splines; piecewise linear interpolator; local stationarity; point singularity; stratified Monte Carlo quadrature; Asian option; Monte Carlo pricing method; Lévy market models; MATHEMATICS Applied mathematics Mathematical statistics; MATEMATIK Tillämpad matematik Matematisk statistik; matematisk statistik; Mathematical Statistics;

    Sammanfattning : In this thesis, we study numerical analysis for random processes and fields. We investigate the behavior of the approximation accuracy for specific linear methods based on a finite number of observations. Furthermore, we propose techniques for optimizing performance of the methods for particular classes of random functions. LÄS MER

  5. 5. Robust inference of gene regulatory networks System properties, variable selection, subnetworks, and design of experiments

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Torbjörn E. M. Nordling; KTH.; [2013]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; network inference; reverse engineering; variable selection; model selection; feature selection; subset selection; system identification; system theory; network theory; subnetworks; design of experiments; perturbation experiments; gene regulatory networks; biological networks;

    Sammanfattning : In this thesis, inference of biological networks from in vivo data generated by perturbation experiments is considered, i.e. deduction of causal interactions that exist among the observed variables. Knowledge of such regulatory influences is essential in biology. LÄS MER