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 53 for “"Completion problem"”.

  1. Non-chordal patterns associated with the positive definite completion problem

    … are specified and some unspecified. In general completion problems ask whether a given partial matrix, may be completed to a matrix where all the entries are specified, such that this completion admits a specific structure. The positive definite completion problem asks whether a partial …

    nwu-za Repository record for Non-chordal patterns associated with the positive definite completion problem (opens in a new tab)

  2. The matrix completion problem regarding various classes of P0,1- matrices

    … in an n x n real matrix is said to have pi-completion if every partial pi-matrix which specifies that pattern can be completed to a pi-matrix. An n x n partial matrix A (and the pattern describing the specified entries of A) is associated with a digraph G(V E) where the vertices V of G are …

    iastate Repository record for The matrix completion problem regarding various classes of P0,1- matrices (opens in a new tab)

  3. The logarithmic method and the solution to the TP2-completion problem

    … entries are free to be chosen. A TP2-completion, of a partial matrix T , is a choice of values for the unspecified entries of T so that the resulting matrix is TP2. The TP2-completion problem asks which partial matrices have a TP2-completion. A complete solution is given here. It is …

    wm-mary Repository record for The logarithmic method and the solution to the TP2-completion problem (opens in a new tab)

  4. Completion problem for stochastic matrices with a single specified column minimizing Kemeny's constant

    … of Markov chains in the lens of a matrix completion problem. Suppose we have a partial stochastic matrix, i.e., a stochastic matrix some of whose entries are specified while some are unspecified. A completion problem asks what choice of values for the unspecified entries should be taken so …

    manitoba Repository record for Completion problem for stochastic matrices with a single specified column minimizing Kemeny's constant (opens in a new tab)

  5. Scaled matrix completion and cell deconvolution with NanoString data

    This thesis explores two research problems in Chapters 1 and 2. Chapter 1 combines pivotal penalized estimation, with matrix completion, to introduce a new matrix completion problem, where the optimal tuning parameter does not depend on the variance of the noise. We consider this new "scaled matrix …

    washington Repository record for Scaled matrix completion and cell deconvolution with NanoString data (opens in a new tab)

  6. Structured eigenvectors, interlacing, and matrix completions

    … structured eigenvectors, interlacing, and matrix completion problems. Although these are distinct topics, the structured eigenvector results provide connections.;It is a straightforward matrix calculation that if {dollar}\lambda{dollar} is an eigenvalue of A, x an associated structured eigenvector …

    wm-mary Repository record for Structured eigenvectors, interlacing, and matrix completions (opens in a new tab)

  7. Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm

    The goal of any completion problem in matrix theory is to determine when a partial matrix can be completed to a matrix that conforms to certain conditions, where a partial matrix is a matrix with some unspecified entries. We consider the completion problem of a few classes of symmetric matrices …

    nwu-za Repository record for Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm (opens in a new tab)

  8. Ultraconnected and Critical Graphs

    … graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves …

    byu Repository record for Ultraconnected and Critical Graphs (opens in a new tab) Download PDF for Ultraconnected and Critical Graphs (opens in a new tab)

  9. Edge modification on perfect and reducible graphs with application to watermarking

    In graph modification problems, we have to repair, improve, or adjust a graph to satisfy appropriate properties while minimizing the cost of the modification. The study of graph modification problems is crucial to computer science as they find applications in different areas, such as biology, …

    greece Repository record for Edge modification on perfect and reducible graphs with application to watermarking (opens in a new tab)

  10. Hypothesis Test for Manifolds and Networks

    … manifold or a large network. Motivated by the problems that arise in recommendation systems, power systems, and social media, etc., this dissertation aims to provide statistical modeling for such problems and perform statistical inferences. This dissertation focus on two problems. (i) …

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

  11. Nonseparable multivariate wavelets

    … of the method of Lai [12] for the biorthogonal completion of a polyphase matrix under suitable conditions.;One-dimensional techniques which cannot be generalized include the factorization of the polyphase matrix, and a general solution to the completion problem.</p>

    iastate Repository record for Nonseparable multivariate wavelets (opens in a new tab)

  12. Moment sequences and their applications

    … present a unified treatment of compact moment problems, both the truncated and full moment cases. Second, we define the lower and upper functions V±(ð₁,... ð <sub>n</sub>) on the convex hull of the curve Γ<sub>n</sub> = {(t,.·.,t<sup>n</sup>): t ∈ [0,1] } for each positive integer n. Explicit …

    vt Repository record for Moment sequences and their applications (opens in a new tab)

  13. 3D SHAPE COMPLETION WITH DEEP NEURAL NETWORKS

    … and segmentation. To alleviate the above problems, this thesis introduces three methods to solve the shape completion problem in 3D point clouds. For 3D point cloud completion, we aim to generate dense and complete point clouds from partial and sparse inputs. We propose to improve the …

    nus Repository record for 3D SHAPE COMPLETION WITH DEEP NEURAL NETWORKS (opens in a new tab) Download file for 3D SHAPE COMPLETION WITH DEEP NEURAL NETWORKS (opens in a new tab)

  14. Structured low complexity data mining

    … we will consider the collaborative filtering problem, specifically the task of matrix completion. The matrix completion problem is likewise severely ill-posed but with a low rank prior, the matrix completion problem with high probability admits a unique and robust solution via a cadre of …

    texas Repository record for Structured low complexity data mining (opens in a new tab)

  15. On alternating direction methods for monotropic semidefinite programming

    … for solving monotropic semidefinite programming problems. In order to avoid solving difficult sub-variational inequality problems on matrix space at each iteration, we establish a set of projection-based algorithms. We discuss alternating direction methods in different ways to deal with quadratic …

    nus Repository record for On alternating direction methods for monotropic semidefinite programming (opens in a new tab) Download file for On alternating direction methods for monotropic semidefinite programming (opens in a new tab)

  16. Wavelet and its Applications

    … reduces the construction to a constant matrix completion problem rather than the usual methods to complete matrices with trigonometric polynomial entries. The constructed wavelets easily satisfy desired properties, e.g. small support, symmetric/anti-symmetric. Several multivariate tight and …

    nus Repository record for Wavelet and its Applications (opens in a new tab) Download file for Wavelet and its Applications (opens in a new tab)

  17. Representations of Polytopes

    … is equivalent to solving a low rank matrix completion problem. For any given polytope, we provide a new construction for the known result that there is a combinatorial polytope with a specified ridge that is always projectively equivalent to the given polytope, and we show how this makes a …

    temple Repository record for Representations of Polytopes (opens in a new tab)

  18. Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion

    … reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone containing the feasible set of the semidefinite relaxation. We show how using …

    waterloo Repository record for Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion (opens in a new tab)

  19. Obstructions for local tournament orientation completions

    The orientation completion problem for a hereditary class C of oriented graphs asks whether a given partially oriented graph can be completed to a graph belonging to C. This problem was introduced recently and is a generalization of several existing problems, including the recognition problem for …

    uvic Repository record for Obstructions for local tournament orientation completions (opens in a new tab)

Page 1 of 3