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 4 of 4 for “"Euclidean algorithm"”.

  1. Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms

    … and Sweedler [12] proved that a large class of algorithms on the reals can be modified slightly so that they also work correctly on floating-point numbers. Their main theorem states that, for each input, there exists a precision, called the minimum converging precision (MCP), at and beyond which …

    mit Repository record for Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms (opens in a new tab)

  2. Wavelet Factorization and Related Polynomials

    … of the discrete wavelet transform (DWT) for the algorithms of Daubechies and Sweldens and Mallat. Nearest neighbor lifting is a specific form of the general lifting scheme that improves the lifting algorithm by optimizing the number of efficient memory accesses. Nearest neighbor lifting …

    wustl Repository record for Wavelet Factorization and Related Polynomials (opens in a new tab)

  3. Framework for pedestrian walking behaviour recognition to minimize road accident

    … (4) The precision of classification using Euclidean algorithm for normal walking and calling is 70%. In contrast, for chatting and running behaviour, the accuracy is 100% and 80%, respectively. This study's implication serves the safety system in the V2P context by programming the proposed …

    uthm Repository record for Framework for pedestrian walking behaviour recognition to minimize road accident (opens in a new tab)

  4. First Order Methods for Large-Scale Sparse Optimization

    … problems with a "simple" feasible set such that Euclidean projections onto the set can be computed very efficiently, e.g. the positive orthant, the n-dimensional hypercube, the simplex, and the Euclidean ball. When the feasible set is "simple", the subproblems used to compute the iterates can be …

    columbia-diss Repository record for First Order Methods for Large-Scale Sparse Optimization (opens in a new tab)