Sökning: "minimal problems"

Visar resultat 1 - 5 av 130 avhandlingar innehållade orden minimal problems.

  1. 1. Gröbner Basis Methods for Minimal Problems in Computer Vision

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

    Författare :Henrik Stewenius; Lund University.; Lunds universitet.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer vision; minimal problems; gröbner basis; Matematik; Teknik; Mathematics; Technological sciences;

    Sammanfattning : A method is presented for building solvers for classes of multivariate polynomial equations. The method is based on solving an analogous template problem over a finite field, and then using the elimination order established for this problem for the original class of problems. LÄS MER

  2. 2. Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems

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

    Författare :Martin Byröd; Lund University.; Lunds universitet.; Lund University.; Lunds universitet.; [2010]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Minimal Problems; Bundle Adjustment; Computer Vision; Polynomial Equations;

    Sammanfattning : This thesis presents a number of results and algorithms for the numerical solution of problems in geometric computer vision. In geometric computer vision one tries to extract geometric information about the world and the observer from a sequence of images. LÄS MER

  3. 3. Waring-type problems for polynomials Algebra meets Geometry

    Detta är en avhandling från Stockholm : Department of Mathematics, Stockholm University

    Författare :Alessandro Oneto; Stockholms universitet.; [2016]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; polynomials; Waring problems; Hilbert series; fat points; power ideals; secant varieties; matematik; Mathematics;

    Sammanfattning : In the present thesis we analyze different types of additive decompositions of homogeneous polynomials. These problems are usually called Waring-type problems and their story go back to the mid-19th century and, recently, they received the attention of a large community of mathematicians and engineers due to several applications. LÄS MER

  4. 4. Snow removal routing problems : theory and applications

    Detta är en avhandling från Linköping : Linköpings universitet

    Författare :Gholamreza Razmara; Linköpings universitet.; Linköpings universitet.; [2004]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Sammanfattning : The focus of this dissertation is on constructing optimization models and developing solution methods for Snow Removal Routing Problems with Time V\lindows. Two cases, after and during snowfall, are studied. LÄS MER

  5. 5. Around minimal Hilbert series problems for graded algebras

    Detta är en avhandling från Stockholm : Department of Mathematics, Stockholm University

    Författare :Lisa Nicklasson; Samuel Lundqvist; Christian Gottlieb; Uwe Nagel; [2020]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graded algebras; Hilbert series; Lefschetz properties; Exterior algebra; Linear resolution; matematik; Mathematics;

    Sammanfattning : The Hilbert series of a graded algebra is an invariant that encodes the dimension of the algebra's graded compontents. It can be seen as a tool for measuring the size of a graded algebra. This gives rise to the idea of algebras with a "minimal Hilbert series", among the algebras within a certain family. LÄS MER