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 56 for “"Matrix Approximation"”.

  1. Matrix Approximation And Image Compression

    … in image compression. An image is stored as a matrix of values with each entry containing a value recording the intensity of a corresponding pixel, so image compression is essentially equivalent to matrix approximation. First, we look at the singular value decomposition, one of the central …

    calpoly Repository record for Matrix Approximation And Image Compression (opens in a new tab)

  2. CUR Matrix Approximation Through Convex Optimization

    In this dissertation we present work on the CUR matrix approximation. Specifically, we present 1) an approximation of the proximal operator of the L-infinity norm using a neural network, 2) a novel deterministic CUR formulation and algorithm, and 3) a novel application of CUR as a feature selection …

    maryland Repository record for CUR Matrix Approximation Through Convex Optimization (opens in a new tab)

  3. oASIS: Adaptive Column Sampling for Kernel Matrix Approximation

    … without explicitly computing the entire kernel matrix. We provide conditions under which oASIS is guaranteed to exactly recover the kernel matrix with an optimal number of columns selected. Numerical experiments on both synthetic and real-world datasets demonstrate that oASIS achieves …

    rice Repository record for oASIS: Adaptive Column Sampling for Kernel Matrix Approximation (opens in a new tab)

  4. Novel Fast Algorithms For Low Rank Matrix Approximation

    Recent advances in matrix approximation have seen an emphasis on randomization techniques in which the goal was to create a sketch of an input matrix. This sketch, a random submatrix of an input matrix, having much fewer rows or columns, still preserves its relevant features. In one of such …

    cuny-grad Repository record for Novel Fast Algorithms For Low Rank Matrix Approximation (opens in a new tab)

  5. Complex data analytics via sparse, low-rank matrix approximation

    … 1) we develop Exemplar-based low-rank sparse Matrix Decomposition (EMD), a novel method for fast clustering large-scale data by incorporating low-rank approximations into matrix decomposition-based clustering; 2) we propose ECKF, a general model for large-scale Evolutionary Clustering based on …

    wayne-thes Repository record for Complex data analytics via sparse, low-rank matrix approximation (opens in a new tab)

  6. Learning Recommender Systems with Deep Structured Low Rank Matrix Approximation

    … this study we propose a Deep structured LOw Rank Matrix Approximation model (DLORMA) that incorporates additional stacked denoising autoencoders and local matrix approximations in a loosely coupled fashion. To the best of our knowledge, DLORMA is the first hybrid recommendation system that …

    carleton Repository record for Learning Recommender Systems with Deep Structured Low Rank Matrix Approximation (opens in a new tab)

  7. Channel Estimation in Massive Multi-User MIMO Systems Based on Low-Rank Matrix Approximation

    … challenging due to large number of channel matrix entries to be estimated within a limited coherence time interval. This problem occurs in a single-cell case where both dimensions of the channel matrix grow large. Also, It happens in the multi-cell setting due to the pilot contamination …

    concordia Download PDF for Channel Estimation in Massive Multi-User MIMO Systems Based on Low-Rank Matrix Approximation (opens in a new tab)

  8. Inversion of Geothermal Reservoir Models Using the Adjoint Method and Randomized Low-Rank Matrix Approximation Algorithms

    … and direct methods, as well as randomized matrix algorithms. As demonstrated, the adjoint and direct methods can, by themselves, reduce the cost of standard derivative-based methods for inverting geothermal natural-state and production models. This is especially the case for natural-state …

    auckland-ms Repository record for Inversion of Geothermal Reservoir Models Using the Adjoint Method and Randomized Low-Rank Matrix Approximation Algorithms (opens in a new tab)

  9. Sparse Kernel feature extraction

    … extraction is considered for three objectives: matrix approximation, supervised feature extraction andlearning the semantics of two-viewed data. Computational and memory efficiency is prioritised, as well as sparsity in a direct manner and simple implementations. For the matrix approximation …

    soton Download PDF for Sparse Kernel feature extraction (opens in a new tab)

  10. The science of high performance algorithms for hierarchical matrices

    … such structure is exposed by appropriate matrix permutation of rows and columns, and exploited by constructing an hierarchical approximation. That is, the matrix can be written as a summation of sparse and low-rank matrices and this structure repeats recursively. Matrices that admit such …

    texas Repository record for The science of high performance algorithms for hierarchical matrices (opens in a new tab)

  11. Time-Dependent Many-Body Perturbation Theory: Possibilities and Limitations

    … exact solution. The main outcomes are that the T-matrix approximation works well in the low filling regime and that all approximation which involve correlation effects develop an unphysical steady state. In paper II we present the methodology used in paper I. We find that the correlation-induced …

    lund Repository record for Time-Dependent Many-Body Perturbation Theory: Possibilities and Limitations (opens in a new tab) Download PDF for Time-Dependent Many-Body Perturbation Theory: Possibilities and Limitations (opens in a new tab)

  12. An energy-based model of areas tiling the cortex and its fast computation

    … this issue, in this work we have applied several approximation methods including biharmonic matrix approximation (BHA) and sparse sampling for faster Gibbs sampling. We use time, jumping distance, instability and Kullback–Leibler divergence as our comparison metric for efficiency and accuracy. We …

    texas Repository record for An energy-based model of areas tiling the cortex and its fast computation (opens in a new tab)

  13. Registering a Non-Rigid Multi-Sensor Ensemble of Images

    … unstable. We solved this problem by using the matrix approximation afforded by the singular value decomposition (SVD). Experiments showed that the method is successfully applied to non-rigid multi-sensor ensembles and overall yields better registration results than methods that register only 2 …

    waterloo Repository record for Registering a Non-Rigid Multi-Sensor Ensemble of Images (opens in a new tab)

  14. Hypothesis Test for Manifolds and Networks

    … We start with the rank selection problem in the matrix completion problem. We addressed the problem of rank identifiability in minimum rank matrix completion problem and proposed a statistical model for the low-rank matrix approximation problem. We then generalize the problem to a more general …

    gatech Repository record for Hypothesis Test for Manifolds and Networks (opens in a new tab)

  15. Perturbation theory of nuclear matter and finite nuclei

    … for including the "core volume energy" in the K-matrix approximation. A later discussion includes a study of other nuclear matter theories, and discloses a previously unreported second order difference between an expansion of the equations of the Puff theory and the Brueckner-Goldstone expansion. …

    nps Repository record for Perturbation theory of nuclear matter and finite nuclei (opens in a new tab)

  16. Matrix nearness problems in data mining

    … mining and machine learning that may be cast as matrix nearness problems. Some exam- ples of well-known nearness problems are: low-rank approximations, sparse approximations, clustering, co-clustering, kernel learning, and independent components analysis. In this thesis we study two types of …

    texas Repository record for Matrix nearness problems in data mining (opens in a new tab)

  17. Three-alpha final state interactions with Faddeev theory

    … and the reduction using the separable t-matrix approximation are given. Chapter III contains a discussion of the two-body interactions used to generate the separable t-matrix and in Chapter IV the form taken for the initial bound state breakup vertex is presented. Numerical methods for …

    rice Repository record for Three-alpha final state interactions with Faddeev theory (opens in a new tab)

  18. Adaptive Constraint Reduction for Convex Quadratic Programming and Training Support Vector Machines

    … effort by assembling the normal equation matrix with a subset of the constraints. Instead of the exact matrix, we compute an approximate matrix for a well chosen index set which includes indices of constraints that seem to be most critical. Starting with a large portion of the constraints, …

    maryland Repository record for Adaptive Constraint Reduction for Convex Quadratic Programming and Training Support Vector Machines (opens in a new tab)

  19. Fast Kernel Matrix Approximations By Series Expansions

    … scale quadratically with the amount of data for matrix-vector multiplies and cubically for solving linear systems. Since applications typically deal with large amounts of data (e.g., training data points for machine learning applications, quadrature nodes for integrals on complex and/or high …

    cornell Repository record for Fast Kernel Matrix Approximations By Series Expansions (opens in a new tab)

  20. Data Streaming Algorithms for Rapid Cyber Attack Detection

    … super spreaders. Lastly, we apply the low-rank matrix approximation to monitor network-wide traffic anomalies and traffic activity graphs.</p>

    iastate Repository record for Data Streaming Algorithms for Rapid Cyber Attack Detection (opens in a new tab)

Page 1 of 3