Sökning: "Geometric Networks"

Visar resultat 1 - 5 av 13 avhandlingar innehållade orden Geometric Networks.

  1. 1. Approximation Algorithms for Geometric Networks

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Mattias Andersson; Lunds universitet.; Lund University.; Malmö University.; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; systems; control; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap; TECHNOLOGY Information technology; TEKNIKVETENSKAP Informationsteknik; Technology;

    Sammanfattning : Det huvudsakliga bidraget i denna avhandling är approximationsalgoritmer för flera problem inom beräkningsgeometri. Den underliggande strukturen för de flesta problemen är ett geometriskt nätverk. LÄS MER

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

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Yubin Kuang; Lunds universitet.; Lund University.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; geometric problems; polynomial solver; computer vision; sensor networks; symmetry;

    Sammanfattning : 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. LÄS MER

  3. 3. Geometric Decompositions and Networks - Approximation Bounds and Algorithms

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Joachim Gudmundsson; Lunds universitet.; Lund University.; Lunds universitet.; Lund University.; [2000]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; computer technology; kontroll; system; Delaunay triangulation; Computational geometry; TSP with neighborhoods; geometric spanners; covering polygons; Computer science; numerical analysis; systems; control; numerisk analys; Datalogi; algebraisk topologi; algebraic topology; Geometry; Data- och systemvetenskap; Geometri;

    Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER

  4. 4. Word Sense Embedded in Geometric Spaces - From Induction to Applications using Machine Learning

    Detta är en avhandling från Chalmers University of Technology

    Författare :Mikael Kågebäck; Chalmers tekniska högskola.; Chalmers University of Technology.; Chalmers tekniska högskola.; [2016]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; HUMANIORA; HUMANITIES; deep learning; neural networks; word sense disambiguation; reinforcement learning; word embeddings; word sense induction; natural language procsessing; extractive summarisation;

    Sammanfattning : .... LÄS MER

  5. 5. Modeling of Protein Folding and Genetic Networks

    Detta är en avhandling från Department of Theoretical Physics, Lund University

    Författare :Fredrik Sjunnesson; Lunds universitet.; Lund University.; [2003]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; thermodynamics; Matematisk och allmän teoretisk fysik; two-state folding; Protein folding; all-atom model; Mathematical and general theoretical physics; Kauffman model.; local update; Monte Carlo; classical mechanics; quantum mechanics; relativity; statistical physics; gravitation; klassisk mekanik; kvantmekanik; relativitet; statistisk fysik; termodynamik; Fysicumarkivet A:2003:Sjunnesson;

    Sammanfattning : Models for potein folding are developed and applied to peptides and small proteins with both α-helix and β-sheet structure. The energy functions, in which effective hydrophobicity forces and hydrogen bonds are taken to be the two central terms, are sequence-based and deliberately kept simple. LÄS MER