Search for dissertations about: "polynomial time"

Showing result 6 - 10 of 159 swedish dissertations containing the words polynomial time.

  2. 6. Polynomial Solvers for Geometric Problems - Applications in Computer Vision and Sensor Networks

    Author : Yubin Kuang; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; polynomial solver; geometric problems; computer vision; sensor networks; symmetry;

    Abstract : Given images of a scene taken by a moving camera or recordings of a moving smart phone playing a song by a microphone array, how hard is it to reconstruct the scene structure or the moving trajectory of the phone? In this thesis, we study and solve several fundamental geometric problems in order to provide solutions to these problems. The key underlying technique for solving such geometric problems is solving systems of polynomial equations. READ MORE

  4. 7. Robust Sound Field Control for Audio Reproduction : A Polynomial Approach to Discrete-Time Acoustic Modeling and Filter Design

    Author : Lars-Johan Brännmark; Anders Ahlén; Mikael Sternad; Mathias Johansson; Rodney Kennedy; Uppsala universitet; []
    Keywords : Acoustic signal processing; equalizers; error modeling; feedforward control; interpolation; loudspeakers; multivariable filters; polynomials; robustness; sound fields;

    Abstract : This thesis is concerned with the design and analysis of robust discrete-time filters for audio equalization and sound field control in real reverberant environments. Inspired by methods in polynomial control theory, a unified framework for acoustic modeling and filter design is developed. READ MORE

  5. 8. Studies on identification of time-variant and time-varying nonlinear systems

    Author : Anders Nordsjö; KTH; []
    Keywords : ;

    Abstract : This thesis addresses same aspects of nonlinear systemidentification. In par ticular, it is assumed that theconsidered systems can be described by the Wiener model whichconsists of a dynamit linear part followed by a nonbnear partor the Haxnmerstein model in which the order of these twoblocks is reversed. READ MORE

  6. 9. On Complexity Measures in Polynomial Calculus

    Author : Mladen Mikša; Jakob Nordström; Jacobo Torán; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    Abstract : Proof complexity is the study of different resources that a proof needs in different proof systems for propositional logic. This line of inquiry relates to the fundamental questions in theoretical computer science, as lower bounds on proof size for an arbitrary proof system would separate P from NP. READ MORE

  7. 10. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics

    Author : Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; Mälardalens högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Just-in-time; JIT sequencing; apportionment; product rate variation; output rate variation; algorithms; heuristics; supply chain; logistics; queueing; non-linear integer programming; Mathematics Applied Mathematics; matematik tillämpad matematik;

    Abstract : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. READ MORE