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 6 of 6 for “"Prefix Sum"”.

  1. Real-time photographic local tone reproduction using summed-area tables

    … é baseada no uso de tabelas de áreas acumuladas (summed-area tables) para acelerar a convolução das vizinhanças, usando filtros da média (box-filter), proporcionando uma solução elegante para aplicações que utilizam imagens em alta faixa dinâmica e que necessitam de performance sem comprometer a …

    brazil-ufrgs Repository record for Real-time photographic local tone reproduction using summed-area tables (opens in a new tab)

  2. High Performance Issues on Parallel Architectures

    … construct and control. This architecture allows prefix computations, such as prefix sum, prefix maximum(minimum) to be accomplished in O(log n) time. These functions then form the building blocks for complex procedures, which more fully exploit the communication flexibility of the architecture. …

    odu Repository record for High Performance Issues on Parallel Architectures (opens in a new tab)

  3. Efficient Viewshed Computation Algorithms On GPUs and CPUs

    … sectors accurately between threads and (2) consumption of excessive amount of memory. Both problems have been resolved in the newly proposed algorithms. We were able to parallelize the algorithm by building a histogram for cells’ events based on their azimuth-angle in the grid. The histogram we …

    usf Repository record for Efficient Viewshed Computation Algorithms On GPUs and CPUs (opens in a new tab)

  4. Data Structuring Problems in the Bit Probe Model

    … such as existential range query, dynamic prefix sum, segment representative, connectivity problems, etc. The second structure considered is for integer representation. We examine the problem of integer representation in a nearly minimal number of bits so that increment and decrement (and …

    waterloo Repository record for Data Structuring Problems in the Bit Probe Model (opens in a new tab)

  5. Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms

    … to remove the redundancy rigorously, which consumes time. In the same way, when traversing these tight spaces, the time required to query also increases compared to a matrix or an adjacency list. In this dissertation, we provide the encoding technique to store the arrays in the Compressed …

    oklahoma-thes Repository record for Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms (opens in a new tab)

  6. GPU-Specfic Kalman Filtering and Retrodiction for Large-Scale Target Tracking

    <p>In the field of Tracking and Data Fusion most, if not all, computations executed by a computer are carried out serially. The sole part of the process that is not entirely serial is the collection of data from multiple sensors, which can be executed in parallel. However, once the data is to be …

    mcmaster Repository record for GPU-Specfic Kalman Filtering and Retrodiction for Large-Scale Target Tracking (opens in a new tab)