Sökning: "polynomial constraints"

Visar resultat 16 - 20 av 37 avhandlingar innehållade orden polynomial constraints.

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

    Författare :Henrik Stewenius; Matematik LTH; []
    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

  3. 17. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Författare :Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

  4. 18. Performance Analysis and Optimization for Time Critical Networking

    Författare :Emmanouil Fountoulakis; Nikolaos Pappas; Vangelis Angelakis; Qi Liao; Giuseppe Durisi; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Future communication systems will be characterized by heterogeneous traffic and requirements. Time critical applications like cyberphysical systems, augmented and virtual reality, raise the need for a low-latency based network. At the same time, conventional devices requiring for high throughput will co-exist with time critical applications. LÄS MER

  5. 19. Real-Time Workload Models : Expressiveness vs. Analysis Efficiency

    Författare :Martin Stigge; Wang Yi; Sanjoy Baruah; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; task models; EDF; fixed-priority scheduling; schedulability analysis; response-time analysis; abstraction refinement; Computer Science with specialization in Real Time Systems; Datavetenskap med inriktning mot realtidssystem;

    Sammanfattning : The requirements for real-time systems in safety-critical applications typically contain strict timing constraints. The design of such a system must be subject to extensive validation to guarantee that critical timing constraints will never be violated while the system operates. LÄS MER

  7. 20. On Structured System Identification and Nonparametric Frequency Response Estimation

    Författare :Per Hägg; Bo Wahlberg; Tomas McKelvey; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : To keep up with the ever increasing demand on performance and efficiency of control systems, accurate models are needed. System identification is concerned with the estimation and validation of mathematical models of dynamical systems from experimental data. LÄS MER