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 5 of 5 for “"Parallel and distributed algorithms"”.

  1. Parallel Sparse Optimization

    This thesis proposes parallel and distributed algorithms for solving very largescale sparse optimization problems on computer clusters and clouds. Many modern applications problems from compressive sensing, machine learning and signal and image processing involve large-scale data and can be modeled …

    rice Repository record for Parallel Sparse Optimization (opens in a new tab)

  2. A task-based message passing framework

    Over the past decade, it has become clear that parallel and distributed programming will occupy an increasingly larger proportion of a developer's work. While numerous programming languages and libraries have been built to facilitate working with concurrency, developer work is still difficult and …

    concordia Download PDF for A task-based message passing framework (opens in a new tab)

  3. Distributed analysis of Markov chains

    This thesis examines how parallel and distributed algorithms can increase the power of techniques for correctness and performance analysis of concurrent systems. The systems in question are state transition systems from which Markov chains can be derived. Both phases of the analysis pipeline are …

    cape-town Repository record for Distributed analysis of Markov chains (opens in a new tab)

  4. Big mobility data analytics: algorithms and techniques for efficient trajectory clustering

    … in terms of storage, querying, analytics and knowledge extraction from mobility data. One of these challenges is cluster analysis, which aims at identifying clusters of moving objects according to the similarity degree of their movement. Discovering clusters of moving objects is an …

    greece Repository record for Big mobility data analytics: algorithms and techniques for efficient trajectory clustering (opens in a new tab)

  5. On the design of a framework for large-scale exploratory graph analytics

    … routinely analyze data from the natural, social, and computing sciences by representing it as networks, or graphs, where objects become vertices and their relationships become edges. This representation allows data scientists to add graph analytics to their toolbox. However, designing tools for …

    njit Repository record for On the design of a framework for large-scale exploratory graph analytics (opens in a new tab)