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 49 for “"sparse graph"”.

  1. Complexity constrained design of sparse graph codes

    … for the design of capacity-approaching sparsegraph codes, under the assumption of an arbitrary number of decoder iterations. Howeverin many practical situations, latency requirements or hardware constraints maylimit the available number of iterations. This thesis develops methodologies …

    adelaide Repository record for Complexity constrained design of sparse graph codes (opens in a new tab)

  2. Sparse Graph Algorithms For Analytics And Prediction Tasks

    Graphs are ubiquitously used to model large-scale real-world data in our everyday lives. With the growing sizes of these graphs and their expanding application to various tasks, there has been an increasing interest in creating efficient graph algorithms and processing systems. Historically, …

    umn Repository record for Sparse Graph Algorithms For Analytics And Prediction Tasks (opens in a new tab)

  3. Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection

    Learning a suitable graph is an important precursor to many graph signal processing (GSP) tasks, such as graph signal compression and denoising. Previous graph learning algorithms either make assumptions on graph connectivity (e.g., graph sparsity), or make individual edge weight assumptions such …

    york Repository record for Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative GLASSO and Projection (opens in a new tab)

  4. A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph

    … of finding the minimal Hamiltonian chain of a graph. A single chain must traverse all 𝑛 vertices of a graph with the minimal distance. The proposed procedure reduces a large problem into several smaller problems and uses a branch and bound algorithm to find the minimal Hamiltonian chain of each …

    vt Repository record for A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph (opens in a new tab)

  5. All-Near-Neighbor Search Among High-Dimensional Data via Hierarchical Sparse Graph Code Filtering

    … as follows. (i) We proclaim the inherent sparse distribution of a finite discrete dataset in a high-dimensional space. We demonstrate that exploiting this sparsity is pivotal to dispelling the so-called curse of dimensionality in theoretical analysis and practical algorithm design. (ii) We …

    duke Repository record for All-Near-Neighbor Search Among High-Dimensional Data via Hierarchical Sparse Graph Code Filtering (opens in a new tab)

  6. Similarity modeling for machine learning

    … learning method, then introduce two novel sparse similarity modeling methods for high dimensional data from the perspective of manifold learning and subspace learning. Our sparse similarity modeling methods learn sparse similarity and consequently generate a sparse graph over the data. The …

    uiuc Repository record for Similarity modeling for machine learning (opens in a new tab)

  7. Resource Allocation on Sparse Graphs

    Considering a network of workers represented by a sparse graph where each worker (ie. node) has a specific load of small independent jobs, our aim is to move the jobs around such that all tasks will be carried out while the communication is minimized. We examine the performance of a new algorithm …

    aston Repository record for Resource Allocation on Sparse Graphs (opens in a new tab) Download PDF for Resource Allocation on Sparse Graphs (opens in a new tab)

  8. Learning Robust Graph Neural Networks with Limited Supervision

    Graph Neural Networks (GNNs) have demonstrated significant success in various graph-related tasks. However, their performance is highly dependent on the availability of sufficient, class-balanced annotated data and an accurate graph structure. GNNs are vulnerable to substantial performance …

    carleton Repository record for Learning Robust Graph Neural Networks with Limited Supervision (opens in a new tab)

  9. Energy-based segmentation methods

    … Subtractive Clustering K-Means with Filtering, Sparse Graph Spectral Clustering, Gaussian mixture on Markov random field, and Adaptive Thresholding in segmenting multimodal grayscale images.

    ubc Repository record for Energy-based segmentation methods (opens in a new tab) Download PDF for Energy-based segmentation methods (opens in a new tab)

  10. Connectivity based parcellation and brain atlas generation - extracting connectome information for Schizophrenia research

    … then formulated as a min-cut problem on a big, sparse graph. Spectral clustering and an original multi-class Hopfield network (MHN) method is applied to solve the problem, each working with a different analytical framework: MHN works in the diffusion space to generate individual parcellations, …

    maryland Repository record for Connectivity based parcellation and brain atlas generation - extracting connectome information for Schizophrenia research (opens in a new tab)

  11. Multi-Label Learning for Semantic Image Annotation

    … problem, this thesis proposes an efficient sparse graph based multi-label learning scheme for large-scale image annotation, whereby both the efficacy and accuracy are further enhanced.

    nus Repository record for Multi-Label Learning for Semantic Image Annotation (opens in a new tab) Download file for Multi-Label Learning for Semantic Image Annotation (opens in a new tab)

  12. Probabilistic search on optimized graph topologies

    … environment as a simple connected, undirected graph. By adding new edges to the graph, we change the search environment. Our objective is to optimize search performance, that is, to minimize the (expected) time needed to find the target, in the context of probabilistic search. We first analyze …

    nps Repository record for Probabilistic search on optimized graph topologies (opens in a new tab)

  13. On the design of architecture-aware algorithms for emerging applications

    … consider both dense numerical computations and sparse graph algorithms. This dissertation also covers emerging applications from image processing, complex network analysis, and computational biology. We map these problems to diverse multicore processors and manycore accelerators. We also use new …

    gatech Repository record for On the design of architecture-aware algorithms for emerging applications (opens in a new tab)

  14. Traffic Lights Management Using Belief Propagation

    … be applied to a road network, represented by a sparse graph, such that each junction shares traffic and traffic light control information with neighbouring junctions. It is the aim of the project to devise a belief propagation algorithm for efficient traffic lights management of a given road …

    aston Repository record for Traffic Lights Management Using Belief Propagation (opens in a new tab) Download PDF for Traffic Lights Management Using Belief Propagation (opens in a new tab)

  15. Belief Propagation on Dense Graphs with Few Strong Links

    … when the problem can be represented by a sparse graph. They have been used to solve a range of computational problems such as decoding, graph colouring, satisfiability problems etc. In this approach, messages containing probabilistic information about nodes in the graph are being passed …

    aston Repository record for Belief Propagation on Dense Graphs with Few Strong Links (opens in a new tab) Download PDF for Belief Propagation on Dense Graphs with Few Strong Links (opens in a new tab)

  16. (Sparse) Exchangeable Random Graphs

    … valued datasets fall under the remit of the graphon (cf. dense exchangeable) framework. These models are defined by a multi-dimensional analogue to de Finetti style exchangeability that provides a natural formalization of the requirement that the labels of a random graph carry no information …

    toronto-retro Repository record for (Sparse) Exchangeable Random Graphs (opens in a new tab)

  17. Applications of Sparse Signal Recovery: 2D-Pattern Matching and Sparse Walsh-Hadamard Transform Computation

    We study two problems related to sparse signal recovery. The first problem considered is querying a sub-image of size square of M in a large image database of size square of N to determine all the locations where sub-image appears. We use sparse graph based codes Fourier transform computation to …

    tamu Repository record for Applications of Sparse Signal Recovery: 2D-Pattern Matching and Sparse Walsh-Hadamard Transform Computation (opens in a new tab)

  18. Graph-based and algebraic codes for error-correction and erasure recovery

    Expander codes are sparse graph-based codes with good decoding algorithms. We present a linear-time decoding algorithm for (C,D, alpha, gamma) expander codes based on graphs with any expansion factor given that the minimum distances of the inner codes are bounded below. We also design graph-based …

    vt Repository record for Graph-based and algebraic codes for error-correction and erasure recovery (opens in a new tab)

  19. Theory and Design of Graph-Based Codes for Improved Iterative and Windowed Decoding

    … noisy channels. This dissertation focuses on graph-based codes, which are codes whose representation, encoding, and/or decoding can be visualized using a sparse graph. We examine a variety of problems for understanding and improving low density parity check (LDPC) codes. While iterative …

    nebraska Repository record for Theory and Design of Graph-Based Codes for Improved Iterative and Windowed Decoding (opens in a new tab)

Page 1 of 3