Search for dissertations about: "polynomial time"

Showing result 21 - 25 of 159 swedish dissertations containing the words polynomial time.

  2. 21. Methods for Optimal Model Fitting and Sensor Calibration

    Author : Erik Ask; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Model Fitting; Sensor Networks; Computer Vision; Polynomial Equations; Action Matrix Methods;

    Abstract : The problem of fitting models to measured data has been studied extensively, not least in the field of computer vision. A central problem in this field is the difficulty in reliably find corresponding structures and points in different images, resulting in outlier data. READ MORE

  4. 22. Uncertainty Quantification and Numerical Methods for Conservation Laws

    Author : Per Pettersson; Jan Nordström; Gianluca Iaccarino; Gunilla Kreiss; Rémi Abgrall; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; uncertainty quantification; polynomial chaos; stochastic Galerkin methods; conservation laws; hyperbolic problems; finite difference methods; finite volume methods; Beräkningsvetenskap med inriktning mot numerisk analys; Scientific Computing with specialization in Numerical Analysis;

    Abstract : Conservation laws with uncertain initial and boundary conditions are approximated using a generalized polynomial chaos expansion approach where the solution is represented as a generalized Fourier series of stochastic basis functions, e.g. orthogonal polynomials or wavelets. READ MORE

  5. 23. Modelling and forecasting economic time series with single hidden-layer feedforward autoregressive artificial neural networks

    Author : Gianluigi Rech; Handelshögskolan i Stockholm; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This dissertation consists of 3 essays In the first essay, A Simple Variable Selection Technique for Nonlinear Models, written in cooperation with Timo Teräsvirta and Rolf Tschernig, I propose a variable selection method based on a polynomial expansion of the unknown regression function and an appropriate model selection criterion. The hypothesis of linearity is tested by a Lagrange multiplier test based on this polynomial expansion. READ MORE

  6. 24. Space in Proof Complexity

    Author : Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

    Abstract : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. READ MORE

  7. 25. On the Finite Element Method for the Time-Dependent Ginzburg-Landau Equations

    Author : Johan Ivarsson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; discontinuous Galerkin method; a posteriori error estimate; adaptive finite element method; duality; residual; Ginzburg-Landau equations; superconductivity; residual;

    Abstract : This thesis is primarily concerned with various issues regarding finite element approximation of the time-dependent Ginzburg-Landau equations. The time-dependent Ginzburg-Landau equations is a macroscopic, phenomenological model of superconductivity, consisting of a system of nonlinear, parabolic partial differential equations. READ MORE