Avancerad sökning

Visar resultat 1 - 5 av 37 avhandlingar som matchar ovanstående sökkriterier.

  1. 1. Approximation Algorithms for Geometric Networks

    Författare :Mattias Andersson; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; control; systems; numerical analysis; Computer science; Geometric Networks; Computational Geometry; Approximation Algorithms; Datalogi; numerisk analys; system; kontroll; Systems engineering; computer technology; Data- och systemvetenskap;

    Sammanfattning : The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. LÄS MER

  3. 2. Spatial analysis and modeling of urban transportation networks

    Författare :Jingyi Lin; Yifang Ban; Sten Henning Hansen; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Complex networks; transportation systems; network growth; Evolving networks; centrality; urban systems; topology; space syntax; spatial networks; distance effects; gravity laws; planarity; street network patterns; US airline system; China’s aviation system; network efficiency; cellular structure; hierarchy; network representations; Geodesy and Geoinformatics; Geodesi och geoinformatik;

    Sammanfattning : Transport systems in general, and urban transportation systems in particular, are the backbone of a country or a city, therefore play an intrinsic role in the socio-economic development. There have been numerous studies on real transportation systems from multiple fileds, including geography, urban planning, and engineering. LÄS MER

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

    Författare :Yubin Kuang; Matematik LTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; polynomial solver; geometric problems; 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

  5. 4. Geometric Decompositions and Networks - Approximation Bounds and Algorithms

    Författare :Joachim Gudmundsson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; 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

  7. 5. Mathematical Foundations of Equivariant Neural Networks

    Författare :Jimmy Aronsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; symmetry; geometric deep learning; gauge theory; induced representations; fiber bundles; convolutional neural networks; equivariance;

    Sammanfattning : Deep learning has revolutionized industry and academic research. Over the past decade, neural networks have been used to solve a multitude of previously unsolved problems and to significantly improve the state of the art on other tasks. However, training a neural network typically requires large amounts of data and computational resources. LÄS MER