Search for dissertations about: "geometric problems"
Showing result 21 - 25 of 123 swedish dissertations containing the words geometric problems.
-
21. Subspace Computations via Matrix Decompositions and Geometric Optimization
Abstract : This thesis is concerned with the computation of certain subspaces connected to a given matrix, where the closely related problem of approximating the matrix with one of lower rank is given special attention. To determine the rank and obtain bases for fundamental subspaces such as the range and null space of a matrix, computing the singular value decomposition (SVD) is the standard method. READ MORE
-
22. Solutions and their ambiguities for structure and motion problems
Abstract : This thesis revolves around the problem of solving the structure and motion problem in computer vision. This is the problem of reconstructing the world, the structure, from images taken by a number of cameras undergoing an unknown motion. READ MORE
-
23. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Abstract : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. READ MORE
-
24. An Integration-Reduction Scheme for Simulation of Large Systems with Local Nonlinearity and Uncertainty - Application to moving load problems in railway mechanics
Abstract : The focus of this research is mainly on computational efficiency, as future work is planned for reliability analysis that will be combined with design optimisation. Both these fields are known to be notoriously computationally demanding. READ MORE
-
25. Random geometric graphs and their applications in neuronal modelling
Abstract : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. READ MORE