In this thesis a method for the partially norm constrained least squares problem is presented. The method relies on a large-scale trust-region solver and has a low storage requirement. A combination of image misalignment ...

Sparse Matrix-vector Multiplication (SMvM) is a mathematical technique encountered in many programs and computations and is often heavily used. Solving SMvM in parallel allows for bigger instances to be solved, and problems ...

The goal of bioinformatics is to support science and research in the field of biology through the application of information technology. Proteomics is a field within biology that deals with the study of proteins. This paper ...

This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been ...

We identify an abstract language for component software based on process algebra. Besides the usual operators for sequential, alternative and parallel composition, it has primitives for instantiating components and for ...

A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...

A fast algorithm for producing time-frequency representations (TFRs) is proposed. The resulting TFRs have optional time-frequency resolution up to optimality. The algorithm is further extended with a method known as ...