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 145 for “"distance matrix"”.

  1. Numerical methods for constrained Euclidean distance matrix optimization

    … work regarding a class of constrained Euclidean Distance Matrix (EDM) based optimization models and corresponding numerical approaches. EDM-based optimization is powerful for processing distance information which appears in diverse applications arising from a wide range of fields, from which the …

    soton Download PDF for Numerical methods for constrained Euclidean distance matrix optimization (opens in a new tab)

  2. Euclidean Distance Matrix Correction with a Single Corrupted Element

    … of correcting the error from a noisy Euclidean distance matrix (EDM). An EDM is a matrix where elements are squared distance between points in R^d. We consider the special case where only one of the distance is corrupted. We develop efficient algorithms to solve this problem, initially assuming …

    waterloo Repository record for Euclidean Distance Matrix Correction with a Single Corrupted Element (opens in a new tab)

  3. Further developments of Multidimensional Scaling via Euclidean Distance Matrix Optimization

    … and majorization method SMACOF, Euclidean distance matrix (EDM) optimization is proved to be numerically outstanding. This thesis aims to develop the MDS in different directions via EDM optimization. Firstly, we proposed to improve slacked supervised maximum variance (SMVU) by MDS with raw …

    soton Download PDF for Further developments of Multidimensional Scaling via Euclidean Distance Matrix Optimization (opens in a new tab)

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

    … semidefinite facial 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 …

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

  5. The distance matrix and its variants for graphs and digraphs

    <p>The distance matrix $\mathcal{D}(G)$ of a connected graph $G$ is the matrix whose entries are the pairwise distances between vertices. The distance matrix was defined by Graham and Pollak in 1971 in order to study the problem of loop switching in routing messages through a network. Since then, …

    iastate Repository record for The distance matrix and its variants for graphs and digraphs (opens in a new tab)

  6. Majorization-projection methods for multidimensional scaling via Euclidean distance matrix optimization

    … scaling (MDS), through the Euclidean distance matrix (EDM) optimization. The problem tries to locate a number of points in a low dimensional real space based on some inter-vector dissimilarities (i.e., noise contaminated Euclidean distances), which has been notoriously known to be …

    soton Download PDF for Majorization-projection methods for multidimensional scaling via Euclidean distance matrix optimization (opens in a new tab)

  7. Cospectral constructions and spectral properties of variations of the distance matrix

    … can be associated with matrices by assigning matrix entries corresponding to the graph structure. As the graph grows large so does the matrix making it difficult to understand the graph's properties. The spectrum (multi-set of eigenvalues) of a matrix for a graph gives a snapshot of the graph …

    iastate Repository record for Cospectral constructions and spectral properties of variations of the distance matrix (opens in a new tab)

  8. An Extension of Euclidean Distance Matrix Analysis Applied to Craniofacial Growth Prediction

    … is [sic] introduces a new extension of Euclidean Distance Matrix Analysis (EDMA) as applied to growth prediction analysis. Using EDMA eliminates the presupposition of a set growth pattern, which is introduced by traditional superimposition techniques. When EDMA is extended to analyze prediction …

    loma-linda Repository record for An Extension of Euclidean Distance Matrix Analysis Applied to Craniofacial Growth Prediction (opens in a new tab)

  9. Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix

    … techniques, we can encode a graph into a matrix. However, as the graph grows, so too does the matrix. This leads to computational limitations and necessitates the development of techniques to capture a portion of the graph's structure. Spectral graph theory is one such method, which looks …

    iastate Repository record for Constructions for cospectral graphs for the normalized Laplacian matrix and distance matrix (opens in a new tab)

  10. Short-distance matrix elements for D-meson mixing for 2+1 flavor lattice QCD

    "We study the short-distance hadronic matrix elements for $D$-meson mixing with partially quenched $N_f=2+1$ lattice QCD. We use a large set of the MIMD Lattice Computation Collaboration's gauge configurations with $a^2$ tadpole-improved staggered sea quarks and tadpole-improved L\""uscher-Weisz …

    uiuc Repository record for Short-distance matrix elements for D-meson mixing for 2+1 flavor lattice QCD (opens in a new tab)

  11. An Analysis of Serial Evoked Potentials Using Various Clustering Measures

    … a technique which clusters waveforms using a distance matrix obtained from sampled points of the waveforms. The first chapter gives an overview on the clinical use of evoked potentials, past methods used to classify waveforms and the problem statement. Chapter two describes the signal …

    marquette Repository record for An Analysis of Serial Evoked Potentials Using Various Clustering Measures (opens in a new tab)

  12. Matrix Factorizations, Triadic Matrices, and Modified Cholesky Factorizations for Optimization

    … their application to Newton-type optimization. A matrix is called triadic if it has at most two nonzero off-diagonal elements in each column. Tridiagonal matrices are a special case of these. We prove that the triadic structure is preserved in the Cholesky-related factorizations We analyze its …

    maryland Repository record for Matrix Factorizations, Triadic Matrices, and Modified Cholesky Factorizations for Optimization (opens in a new tab)

  13. SIMD Algorithms for Single Link and Complete Link Pattern Clustering

    … The determination of the smallest entry in the distance matrix and update of the distance matrix is achieved in O(logN) time. In the case of complete link clustering, each PE maintains a heap data structure of the inter pattern distances. This significantly reduces the computation time for the …

    usf Repository record for SIMD Algorithms for Single Link and Complete Link Pattern Clustering (opens in a new tab)

  14. Low rank representations of matrices using nuclear norm heuristics

    … in many instances to the finding the lowest rank matrix among a parameterized family of matrices. In its most general setting, this problem is NP-hard. Different heuristics have been introduced for approaching the problem. Among them is the nuclear norm heuristic for rank minimization. One aspect …

    colostate Repository record for Low rank representations of matrices using nuclear norm heuristics (opens in a new tab)

  15. PRO3DCNN : convolutional neural network for mapping protein structure into folds

    … two classes of input features for each protein: distance matrix and persistent homology images. Due to restrictions in our computing resources, we make sample every other point in the carbon alpha chain. We find that it does not lead to significant loss in accuracy. Using the distance matrix, we …

    missouri Repository record for PRO3DCNN : convolutional neural network for mapping protein structure into folds (opens in a new tab)

  16. Structured eigenvectors, interlacing, and matrix completions

    … presents results from three areas of applicable matrix analysis: 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 …

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

  17. Biological, Linguistic, and Cultural Variation among 19<sup>th</sup> Century Plains Indians

    … constructed biological, linguistic, and cultural distance matrices, based on the Boas database of anthropometric measurements, Ruhlen’s (1976) and Campbell’s (1997) linguistic taxonomies, and Murdock’s (1967) <em>Ethnographic Atlas</em>, respectively. Furthermore, I constructed a geographic …

    ut-knoxville Repository record for Biological, Linguistic, and Cultural Variation among 19<sup>th</sup> Century Plains Indians (opens in a new tab)

  18. Providing statistical inference to case-based software effort estimation

    … The Analogy-X approach combines the notions of distance matrix correlation found in ecology literature and statistic analysis techniques to provide useful inferential statistics to support analogy-based systems. Data-intensive analogy for software effort estimation has been proposed as a viable …

    unsw Repository record for Providing statistical inference to case-based software effort estimation (opens in a new tab)

  19. Generalizations of the Graham-Pollak Tree Theorem

    … showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero. This dissertation will generalize their result via two different directions: Steiner distance k-matrices and distance critical graphs. The Steiner …

    south-carolina Repository record for Generalizations of the Graham-Pollak Tree Theorem (opens in a new tab)

  20. Continued investigations into the relationship between stability, hierarchical clustering algorithm and data set

    … to preserve the distribution of inter-point distances. The resultant tree stabilities indicate that while there are differences in the stability of different subsets and that some algorithms are more sensitive to subset selection, the exact relationships are complex and would require further …

    guelph Repository record for Continued investigations into the relationship between stability, hierarchical clustering algorithm and data set (opens in a new tab)

Page 1 of 8