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 2 of 2 for “"Converting algorithms."”.

  1. Accelerating path planning algorithms with high level synthesis tools and FPGAs.

    Accelerating path planning algorithms with field programmable gate arrays (FPGA) allows the designer to achieve significant performance increases over using a traditional central processing unit (CPU). Converting an algorithm to run on an FPGA is a complicated and time consuming process. This …

    baylor Repository record for Accelerating path planning algorithms with high level synthesis tools and FPGAs. (opens in a new tab)

  2. Algorithms and lower bounds in the streaming and sparse recovery models

    … we provide lower bounds as well as a method of converting algorithms for "standard" sparse recovery into ones for SRPSK. We also make use of one of the reductions to give an optimal algorithm for SRPSK for the guarantee where p = q = 2.

    mit Repository record for Algorithms and lower bounds in the streaming and sparse recovery models (opens in a new tab)