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 7 of 7 for “"neighbor graph"”.
-
Automorphism groups of self-dual codes
… multiples of 4. Moreover, imitating the Kneser neighborhood method, an algorithm is developed to find all self-dual G-invariant codes. In the case where A is semisimple, formulae are given for the number of self-dual G-invariant codes, basically depending on the composition factors of one such …
-
Topologies for ad-hoc networks utilizing directional antennas with restricted fields of view
… of the algorithms are based on the Relative Neighbor Graph (RNG): the first constrains the RNG to requirements of the ORCLE network, the second augments the constrained RNG with edges from the Delaunay Triangulation, and the third algorithm tries to improve on the second by adding edges to …
-
Graph Embedding and Nonlinear Dimensionality Reduction
… analysis (PCA) have been applied to many graph embedding and dimensionality reduction tasks. These methods aim to find low-dimensional representations of data that preserve its inherent structure. However, these methods often perform poorly when applied to data which does not lie exactly …
-
Discovering variation from cell atlases: comparative methods for single-cell genomics
… between conditions in partially overlapping neighborhoods on a k-nearest neighbor graph, Milo can identify perturbations that are obscured by discretizing cells into clusters and it minimizes false discovery rate control even in the presence of batch effects. I present a comprehensive …
-
Optimizing Quantum Circuit Layout using Quantum Annealing
… hardware. One critical limitation is the Nearest Neighbor condition, prevalent in quantum hardware architectures, which necessitates that computations should be performed solely on adjacent qubits. Consequently, additional swapping operations, or SWAP gates, are required to make interacting qubits …
-
Transforming Point Data into Proximity Graphs
Establishing neighborhood relationships among data points is important for several data analysis applications, for which structural information is essential. Since the early 1980’s, proximity graphs have served as one of the classical approaches to characterize neighborhood relationships; the most …
-
Characterizing T Cell Features of Atypical Lymphocytes for the Optimization of Adoptive Immunotherapies
… heterogeneity, we applied Clonotype Neighbor Graph Analysis (CoNGA) to identify clusters of cells based on simultaneous similarity in gene expression landscape and TCR amino acid sequence. CoNGA analysis identified 3 distinct Treg-associated gene expression clusters with high TCR …