Sökning: "Matrix multiplication"

Visar resultat 26 - 29 av 29 avhandlingar innehållade orden Matrix multiplication.

  1. 26. Studies in Efficient Discrete Algorithms

    Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

    Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

  3. 27. On the Implementation of Integer and Non-Integer Sampling Rate Conversion

    Författare :Muhammad Abbas; Håkan Johansson; Oscar Gustafsson; Vassilis Paliouras; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : The main focus in this thesis is on the aspects related to the implementation of integer and non-integer sampling rate conversion (SRC). SRC is used in many communication and signal processing applications where two signals or systems having different sampling rates need to be interconnected. LÄS MER

  4. 28. Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems

    Författare :Martin Byröd; Matematik LTH; []
    Nyckelord :Minimal Problems; Bundle Adjustment; Computer Vision; Polynomial Equations;

    Sammanfattning : This thesis presents a number of results and algorithms for the numerical solution of problems in geometric computer vision. In geometric computer vision one tries to extract geometric information about the world and the observer from a sequence of images. LÄS MER

  5. 29. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

    Författare :Thatchaphol Saranurak; Danupon Nanongkai; Piotr Sankowski; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER