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 9 of 9 for “"Memoization"”.

  1. A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization

    … very compactly and let us to embed the notion of memoization to the DPLL algorithm. These points led us to implement the search algorithm in such a way that we could store and reuse the results of all previously solved subformulas with a little overheads. ZQSAT can solve some sets of standard QBF …

    potsdam-diss Repository record for A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization (opens in a new tab)

  2. Optimizations in stream programming for multimedia applications

    … the accuracy of the program output. We apply a memoization technique that exploits this tolerance and the repetitive nature of multimedia data. We provide a runtime system that automatically tunes the memoization capabilities for performance and output quality. These optimizations are …

    mit Repository record for Optimizations in stream programming for multimedia applications (opens in a new tab)

  3. Secure application partitioning for intellectual property protection

    … under this model the best attack possible is a Memoization Attack." A practical Memoization Attack is implemented, and experimentation reveals that naive partitioning strategies can expose the functionality of hidden code in real applications, allowing unauthorized execution. To protect against …

    mit Repository record for Secure application partitioning for intellectual property protection (opens in a new tab)

  4. DF-DTM :explorando redundância de tarefas em dataflow

    … tasks. This work presents Dataflow Dynamic Task Memoization (DF-DTM) technique, which is inspired by the Von Neumann architecture reuse technique known as DTM [5] (Dynamic Trace Memoization). DF-DTM allows the reuse of nodes and subgraphs in Dataflow models, which are analogous to instructions …

    brazil-uerj Repository record for DF-DTM :explorando redundância de tarefas em dataflow (opens in a new tab)

  5. Scalable algorithms for semi-automatic segmentation of electron microscopy images of the brain tissue

    … computation by using FFT-based convolution with memoization, and (2) parallelization approach that can utilize large number of CPUs while minimizing any required synchronization. - A high throughput inference algorithm that can utilize all available computational resources, CPUs and GPUs. I …

    mit Repository record for Scalable algorithms for semi-automatic segmentation of electron microscopy images of the brain tissue (opens in a new tab)

  6. On the Impact and Defeat of Regular Expression Denial of Service

    … that optimizing an existing regex engine using memoization incurs (perhaps acceptable) space overheads (Chapter 8), and that incorporating resource caps into the framework or runtime is feasible but faces barriers to adoption (Chapter 9). In Part IV of this dissertation, we reflect on our …

    vt Repository record for On the Impact and Defeat of Regular Expression Denial of Service (opens in a new tab)

  7. Software and architecture support for the bulk multicore

    … side-effects of functions to perform function memoization at a large scale. Third, it describes how to use atomic regions and conflict detection hardware to improve alias analysis for general compiler optimizations using speculation. Loop Invariant Code Motion, a widely used traditional compiler …

    uiuc Repository record for Software and architecture support for the bulk multicore (opens in a new tab)

  8. Energy efficient computing exploiting data similarity and computation redundancy

    … variable number of inputs. In contrast, existing memoization techniques mostly replace costly floating-point operations that have a limited number of inputs with memory lookup. Since AxMemo aims to replace long sequences of instructions with a few lookup operations, it alleviates the von Neumann …

    uiuc Repository record for Energy efficient computing exploiting data similarity and computation redundancy (opens in a new tab)

  9. A framework for programming and optimizing temporal graph neural networks

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for A framework for programming and optimizing temporal graph neural networks (opens in a new tab)