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 31 for “"Message passing algorithms"”.

  1. Scalable collective message-passing algorithms

    … has far better time and space scaling than known algorithms. Our evaluations predict an improvement of up to 60x for large exascale systems and arbitrary reduction in the large temporary buffer space required for generating new communicators. Our second contribution consists of several novel …

    uiuc Repository record for Scalable collective message-passing algorithms (opens in a new tab)

  2. Message passing algorithms - methods and applications

    Algorithms on graphs are used extensively in many applications and research areas. Such applications include machine learning, artificial intelligence, communications, image processing, state tracking, sensor networks, sensor fusion, distributed cooperative estimation, and distributed computation. …

    uiuc Repository record for Message passing algorithms - methods and applications (opens in a new tab)

  3. Message Passing Algorithms for Facility Location Problems

    … approach to facility location problems - that of message passing inference in probabilistic graphical models. Using this framework, we develop new heuristic algorithms, as well as a new approximation algorithm for a particular problem type. In machine learning applications, facility location can …

    toronto-retro Repository record for Message Passing Algorithms for Facility Location Problems (opens in a new tab)

  4. Beyond Affinity Propagation: Message Passing Algorithms for Clustering

    … and the hierarchical affinity propagation algorithms. We also discuss the relationship of affinity propagation to some canonical problems in combinatorial optimization. The underlying mechanism of affinity propagation is an approximate inference procedure known as max-product belief …

    toronto-retro Repository record for Beyond Affinity Propagation: Message Passing Algorithms for Clustering (opens in a new tab)

  5. Finite Length Analysis of Verifcation-Based Message Passing Algorithms in Compressed Sensing

    … the finite length analysis of verification-based message-passing algorithms (VB MPAs), analytically. In contrary to asymptotic regime analysis, the finite length analysis is fairly an untouched problem. We begin the analysis by characterizing the problematic combinatorial structures, defined over …

    carleton Repository record for Finite Length Analysis of Verifcation-Based Message Passing Algorithms in Compressed Sensing (opens in a new tab)

  6. On a class of distributed algorithms over networks and graphs

    Distributed iterative algorithms are of great importance, as they are known to provide low-complexity and approximate solutions to what are otherwise high-dimensional intractable optimization problems. The theory of message-passing based algorithms is fairly well developed in the coding, machine …

    texas Repository record for On a class of distributed algorithms over networks and graphs (opens in a new tab)

  7. Simulation Study Of A Gpram System: Error Control Coding And Connectionism

    … assessment on a task; then use approximated message-passing algorithms to improve assessment; and finally selects ways closer to a solution, eventually solving it. We illustrate concepts and structures using simple examples.

    ucf Repository record for Simulation Study Of A Gpram System: Error Control Coding And Connectionism (opens in a new tab)

  8. Optimising power flow in a volatile electrical grid using a message passing algorithm

    … electrical networks, this thesis suggests that a message passing-based approach could be useful for managing power distribution in electricity networks. This thesis shows the adaptability of message passing algorithms and demonstrates and validates its capabilities in addressing scenarios with …

    aston Download PDF for Optimising power flow in a volatile electrical grid using a message passing algorithm (opens in a new tab)

  9. Nested low-density lattice codes based on non-binary LDPC codes

    … codeword. The source coding problem of mapping message to power optimal codeword for any LDPC code is in general, NP-hard. In this thesis, we present a novel method for encoding and decoding lattice based on non-binary LDPC codes using message-passing algorithms.

    texas Repository record for Nested low-density lattice codes based on non-binary LDPC codes (opens in a new tab)

  10. New Message Passing Methods for Min-Max and Sum-Product Inference

    Message passing algorithms powered by the distributive law of mathematics are efficient in finding approximate solutions to NP-hard inference problems. This thesis proposes new message passing algorithms to enable and improve performance in two important modes of inference. First is min-max …

    toronto-retro Repository record for New Message Passing Methods for Min-Max and Sum-Product Inference (opens in a new tab)

  11. Massively parallel message passing on a GPU for graphical model inference

    … challenging. For more effective inference, message passing algorithms that expose significant parallelism have been implemented to exploit graphics processing units (GPUs), albeit often tackling specific graphical model structures such as directed acyclic graphs (DAGs), grids, uniform state …

    uiuc Repository record for Massively parallel message passing on a GPU for graphical model inference (opens in a new tab)

  12. Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network.

    In this thesis, we give message passing algorithms in distributed environment for five different problems of a rooted tree having n nodes. In the first algorithm, every node has a value; the root calculates the sum of those values, and sends it to all the nodes in the network. In the second …

    unlv Repository record for Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. (opens in a new tab) Download PDF for Message Passing Algorithm for Different Problems Sum, Mean, Guide and Sorting in a Rooted Tree Network. (opens in a new tab)

  13. Cavity algorithms under global constraints: classical and quantum problems

    … of my thesis work was the study of optimization algorithms based on cavity method. These algorithms have been developed to a high degree of complexity in the last decade and they are also known as message passing algorithms (MPAs). My work has started by a question posed by my supervisor: what …

    poli-torino Repository record for Cavity algorithms under global constraints: classical and quantum problems (opens in a new tab)

  14. Markov random fields with unknown heterogeneous graphs

    … generally NP-complete, and we thus develop novel algorithms for effectively and efficiently finding approximate solutions. We also demonstrate how to learn Markov random field parameters from data with our inference techniques. Our contributions are as follows. First, we show that estimating …

    adelaide Repository record for Markov random fields with unknown heterogeneous graphs (opens in a new tab)

  15. Decentralised coordination of smart distribution networks using message passing

    … this thesis presents novel decentralised message passing algorithms that coordinate generators in acyclic electricity distribution networks, such that the costs (in terms of carbon dioxide (CO2) emissions) of the entire network are minimised; a technique commonly referred to as optimal …

    soton Download PDF for Decentralised coordination of smart distribution networks using message passing (opens in a new tab)

  16. Towards vaulting the hurdle of short lifetimes in wireless sensor networks : distributed algorithms and UWB impulse radio

    … the network via distributed in-situ broadcast `message-passing' algorithms for filtering, compression and model identification. These algorithms are scalable, power-efficient, stable, and computationally tractable. At the same time their performance is close to the respective ultimate …

    ubc Repository record for Towards vaulting the hurdle of short lifetimes in wireless sensor networks : distributed algorithms and UWB impulse radio (opens in a new tab) Download PDF for Towards vaulting the hurdle of short lifetimes in wireless sensor networks : distributed algorithms and UWB impulse radio (opens in a new tab)

  17. Code-Independent Error Floor Estimation Techniques for Flooding and Layered Decoders of LDPC Codes

    … parity-check (LDPC) codes under iterative message passing algorithms suffer from error floor. In this thesis, we study the harmfulness of problematic graphical structures of LDPC codes, collectively referred to as trapping sets (TSs), which play important roles in the error floor …

    carleton Repository record for Code-Independent Error Floor Estimation Techniques for Flooding and Layered Decoders of LDPC Codes (opens in a new tab)

  18. Iterative Decoding of Codes on Graphs

    … These codes are decoded iteratively using message-passing algorithms, and the performance of these codes for various channels are presented in this report.The application of iterative decoders is generally limited to a class of codes whose graph representations are free of small cycles. …

    arizona-thes Repository record for Iterative Decoding of Codes on Graphs (opens in a new tab)

  19. Scalable Statistical Modeling and Query Processing over Large Scale Uncertain Databases

    … challenges in managing such data and developed algorithms for efficiently executing queries over large volumes of such data. Specifically, I focused on the following challenges. First, for meaningful analysis of such data, we need the ability to remove noise and infer useful information from …

    maryland Repository record for Scalable Statistical Modeling and Query Processing over Large Scale Uncertain Databases (opens in a new tab)

Page 1 of 2