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 4 of 4 for “"Submatrix selection"”.

  1. Improving the applicability of visual SLAM with submodular submatrix selection

    … the scope of this thesis is on online graph selection and sparsification. The thesis is based upon theorems developed in the submatrix selection literature. Originating from computational theory and machine learning, submatrix selection aims at identifying a subset of columns/rows from the …

    gatech Repository record for Improving the applicability of visual SLAM with submodular submatrix selection (opens in a new tab)

  2. Sparse and Low-rank Constrained Optimization: Formulations, Theory, and Algorithms

    … relative to their non-sparse counterparts. The submatrix selection problem can be naturally formulated as discrete optimization since whether to select each candidate element corresponds to a binary variable. This motivates us to explore discrete algorithms and methods. First, we derive …

    gatech Repository record for Sparse and Low-rank Constrained Optimization: Formulations, Theory, and Algorithms (opens in a new tab)

  3. Dimension Reduction and Signal Decomposition for Genotype–Phenotype Relations

    … unavoidable. In Paper III, we present SMSSVD – SubMatrix Selection Singular Value Decomposition, a parameter-free unsupervised signal decomposition and dimension reduction method, particularly useful for data sets with many variables. By adaptively reducing the noise for each signal, SMSSVD …

    lund Repository record for Dimension Reduction and Signal Decomposition for Genotype–Phenotype Relations (opens in a new tab) Download PDF for Dimension Reduction and Signal Decomposition for Genotype–Phenotype Relations (opens in a new tab)