Sökning: "Upper bounds"

Visar resultat 31 - 35 av 115 avhandlingar innehållade orden Upper bounds.

  1. 31. Efficient Algorithms for Graph-Theoretic and Geometric Problems

    Författare :Peter Floderus; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. LÄS MER

  3. 32. Capacity Analysis and Receiver Design in the Presence of Fiber Nonlinearity

    Författare :Kamran Keykhosravi; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; perturbation theory.; Achievable rate; nonlinearity mitigation; noncoherent optics; dispersion compensation; fiber optics; channel capacity; information theory;

    Sammanfattning : The majority of today's global Internet traffic is conveyed through optical fibers. The ever-increasing data demands have pushed the optical systems to evolve from using regenerators and direct-direction receivers to a coherent multi-wavelength network. LÄS MER

  4. 33. Software tools for matrix canonical computations and web-based software library environments

    Författare :Pedher Johansson; Bo Kågström; Erik. Elmroth; Alan Edelman; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Canonical structure; Jordan canonical form; controllability; StratiGraph; Matlab toolbox; Kronecker canonical form; matrix; matrix pencil; perturbation theory; closure hirerarchy; matrix stratification; control system; observability; Numerical analysis; Numerisk analys;

    Sammanfattning : This dissertation addresses the development and use of novel software tools and environments for the computation and visualization of canonical information as well as stratification hierarchies for matrices and matrix pencils. The simplest standard shape to which a matrix pencil with a given set of eigenvalues can be reduced is called the Kronecker canonical form (KCF). LÄS MER

  5. 34. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER

  7. 35. Influence of Fiber Nonlinearity on the Capacity of Optical Channel Models

    Författare :Kamran Keykhosravi; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; nonlinearity mitigation; Fiber optics; information theory; channel capacity; perturbation; achievable rate;

    Sammanfattning : The majority of today’s global Internet traffic is conveyed through optical fibers. The ever-increasing data demands has pushed the optical systems to evolve from using regenerators and direct-direction receivers to a coherent multi-wavelength network. LÄS MER