Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 9272 for “"Sparse"”.
-
Sparse Matrix Sparse Vector Multiplication using Parallel and Reconfigurable Computing
… analysis and insight into the implementation of sparse matrix sparse vector multiplication on a reconfigurable parallel computing platform. Common implementations of sparse matrix sparse vector multiplication are completed by unary processors or parallel platforms today. Unary processor …
-
Sparse Grid Interpolation
… the implementation. Recently, the technique of sparse grids has been introduced to signi cantly reduce the cost to approximate high-dimensional functions under certain regularity conditions. In this thesis, we present the classical sparse grid where the problem is discretized and solved on a …
-
Sparse image approximation
… a number of comparative tests, with respect to sparse image representation, have been performed and analysed.
-
Sparse Automatic Sets
… for automatic sets shows that they are either sparse, having counting functions that grow relatively slowly, or they are not sparse, in which case their counting functions grow reasonably fast. While this dichotomy has been known to hold for some time, there has not---to this point in …
-
Parallel Sparse Optimization
… algorithms for solving very largescale sparse optimization problems on computer clusters and clouds. Many modern applications problems from compressive sensing, machine learning and signal and image processing involve large-scale data and can be modeled as sparse optimization problems. …
-
Endogenous Sparse Recovery
… and machine learning. In all of these settings, sparse recovery methods are employed to recover signals that admit sparse representations in a pre-specified basis. Recently, sparse recovery methods have been employed in an entirely new way; instead of finding a sparse representation of a signal …
-
Sparse ordinary graphs
Ordinary graphs are directed graphs that can be viewed as generalizations of symmetric block designs. They were introduced by Fossorier, Jezek, Nation and Pogel in [2] in an attempt to construct new finite projective planes. In this thesis we investigate some special cases of ordinary graphs, most …
-
Sparse matrix spaces
… zero, or an arbitrary real number. We call them sparse matrix spaces, abbreviated SMS, and examine under what conditions they contain matrices for which all eigenvalues have strictly negative real parts. We call an SMS with this property stable. We start by reviewing the necessary background from …
-
Colouring sparse graphs
Contains fulltext : 208472.pdf (Publisher’s version ) (Open Access)
-
Sparse harmonic transforms
… functions, several versions of high-dimensional sparse Fourier transforms (SFTs) are discussed. One-dimensional sparse Fourier transforms introduced in [1] and [2] quickly approximate functions represented by only s Fourier basis functions using a few samples (function evaluations) without noise …
-
Faster Algorithms for Sparse Decomposition and Sparse Series Solutions to Differential Equations
Sparse polynomials are those polynomials with only a few non-zero coefficients relative to their degree. They can appear in practice in polynomial systems as inputs, where the degree of the input sparse polynomial can be exponentially larger than the bit length of the representation of it. This …
-
Topics in sparse approximation
Sparse approximation problems request a good approximation of an input signal as a linear combination of elementary signals, yet they stipulate that the approximation may involve only a few of the elementary signals. This class of problems arises throughout applied mathematics, statistics, and …
-
Sparse weight activation training
… is computationally and memory intensive. Sparse training can reduce the burden, but it can affect network convergence. In this work, we propose a novel CNN training algorithm Sparse Weight Activation Training (SWAT). SWAT is : (1) more computation and memory-efficient than conventional …
-
Recklessly approximate sparse coding
… nets, factored RBMs, mcRBMs, convolutional RBMs, sparse autoencoders and several others. Moreover, these features are extremely simple and easy to compute. Several intuitive arguments have been put forward to describe this remarkable performance, yet no mathematical justification has been offered. …
-
Sparse Canonical Correlation Analysis
… These problems may be solved by selecting sparse subsets of variables, i.e. obtaining sparse loadings in the linear combinations of variables of each type. However, available methods providing sparse solutions, such as Sparse Principal Component Analysis, consider each type of variables …
-
Robust Sparse Covariance Estimation
Estimating a high-dimensional sparse covariance matrix from a limited number of samples is a fundamental problem in contemporary data analysis. Most proposals to date, however, are not robust to outliers or heavy tails. Towards bridging this gap, in this work we consider estimating a sparse shape …
-
(Sparse) Exchangeable Random Graphs
… the dense exchangeable models to the sparse graph regime. The key ingredient is a novel notion of exchangeability for graphs based on a point process representation of networks. The main results are: The construction of a new modeling framework through a de Finetti style representation …
Page 1 of 464