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 20 of 156 for “"memory requirement"”.

  1. The Effect of Memory Requirement on Schema Learning

    … than a reproduction task due to the increased memory requirement of the reproduction task. Differential memory requirements of 0, 4, 8, 16 and 32 seconds were imposed on 50 Ss in a recognition task to determine if increased memory requirements improved schema learning in the same mode as the …

    unt Repository record for The Effect of Memory Requirement on Schema Learning (opens in a new tab)

  2. Automatic adaptive mesh generation and bandwidth reduction for finite elements

    … Reduction algorithm is developed, which reduces memory requirement and CPU time required for bandwidth reduction of a higher order finite element mesh. This technique is demonstrated for a plate with a central hole, wherein savings of seventy percent for memory requirement and reduction of CPU …

    iastate Repository record for Automatic adaptive mesh generation and bandwidth reduction for finite elements (opens in a new tab)

  3. High performance DFS-based subgraph enumeration on GPUs

    … which exploits parallelism at the cost of high memory requirement, which presents a formidable challenge for processing large graphs since the memory capacity of GPUs is significantly lower than that of CPUs. In this thesis, we propose a fast GPU-based solution based on depth-first traversal of …

    uiuc Repository record for High performance DFS-based subgraph enumeration on GPUs (opens in a new tab)

  4. Polar Codes Decoding Algorithms and FPGA-based Hardware Architectures

    … of a decoding algorithm is considered. The memory requirement for the intermediate information in decoding algorithms takes a large silicon area, in particular belief propagation (BP) decoding. As an alternative to uniform quantization, we suggest employing a non-uniform quantization scheme …

    unsw Repository record for Polar Codes Decoding Algorithms and FPGA-based Hardware Architectures (opens in a new tab)

  5. Ultra-Wideband Microwave Imaging Radar System

    A novel way to reduce the CPU run time and memory requirement of the nonlinear inverse scattering algorithms is also proposed in this study. We propose a code-division multiplexing scheme for the nonlinear inverse scattering algorithms to reduce the computational complexity by a factor proportional …

    uiuc Repository record for Ultra-Wideband Microwave Imaging Radar System (opens in a new tab)

  6. Towards robust design of deep classification models

    … mechanism is computationally expensive as the memory requirement grows quadratically with the input sequence length. This dissertation also presents a divide-and-conquer methodology that relieves the memory requirement for a single device. Specifically, we adopt cyclic quorum sets to …

    iastate Repository record for Towards robust design of deep classification models (opens in a new tab)

  7. Time Domain Integral Equation-Based Methods for Analyzing Electromagnetic Scattering From Objects Residing in Lossy Media

    … complexity scaling as O( N2sN2t ) and a memory requirement as O( N2sNt ), respectively. To alleviate the demands of computational resources, two techniques are proposed in this dissertation, viz., the Prony series-based recursive convolution scheme and the multilevel plane wave time …

    uiuc Repository record for Time Domain Integral Equation-Based Methods for Analyzing Electromagnetic Scattering From Objects Residing in Lossy Media (opens in a new tab)

  8. Distributed stabilizing data structures

    … time complexity) while keeping or lowering the memory requirement (space complexity) in a node. (In sequential algorithms, the memory requirement is the memory requirement of the algorithm itself.); Self-stabilizing distributed algorithms aim to achieve a comparable performance to …

    unlv Repository record for Distributed stabilizing data structures (opens in a new tab) Download PDF for Distributed stabilizing data structures (opens in a new tab)

  9. A Complete Subgoal Graph Method for Ultra-Fast Pathfinding

    … is that it requires a relatively large amount of memory, although this memory requirement is comparable to that used by certain other algorithms, such as Topping. I propose some ideas for future improvement in terms of reducing this memory requirement. CSG is specifically designed for pathfinding …

    anu Repository record for A Complete Subgoal Graph Method for Ultra-Fast Pathfinding (opens in a new tab)

  10. Fast Methods for Variable-Coefficient Peridynamic and Non-Local Diffusion Models

    … typically require O(N3) operations and O(N2) memory storage where N refers to the number of unknowns. A simplified peridynamic model was proposed to reduce the computational cost and memory requirement of the corresponding numerical methods, in which the horizon of the material in the …

    south-carolina Repository record for Fast Methods for Variable-Coefficient Peridynamic and Non-Local Diffusion Models (opens in a new tab)

  11. Discrete Gaussian Sampling for Low-Power Devices

    … cryptosystems. A need for faster and memory-efficient samplers has become a necessity for improving the performance of such cryptosystems. We propose a new algorithm for sampling from the Gaussian distribution that can efficiently change on-the-fly its speed/memory requirement. The …

    washington Repository record for Discrete Gaussian Sampling for Low-Power Devices (opens in a new tab)

  12. Non-uniform octree meshes and their application in Probability of Detection analysis

    … boundary areas of samples to compromise between memory requirement and visualization. Various tools are developed for analyzing the POD maps. A set of interactive programs has also been developed to allow user controlled mesh adjustment.

    iastate Repository record for Non-uniform octree meshes and their application in Probability of Detection analysis (opens in a new tab)

  13. Fast Inhomogeneous Plane Wave Algorithm for Electromagnetic Scattering Problems

    … The resultant computational complexity and the memory requirement of this implementation scale as O(N log N) and O( N), respectively. Several large-scale problems with more than one million unknowns have been successfully solved. It is shown that FIPWA is a promising fast algorithm for solving …

    uiuc Repository record for Fast Inhomogeneous Plane Wave Algorithm for Electromagnetic Scattering Problems (opens in a new tab)

  14. Algorithm Optimization and Hardware Acceleration for Machine Learning Applications on Low-energy Systems

    … by the high computational complexity and memory requirement. On the other hand, the massive parameter quantity for the modern ML models appends extra demands on the system's I/O speed and memory size. This dissertation investigates feasible solutions for those challenges with …

    clemson Repository record for Algorithm Optimization and Hardware Acceleration for Machine Learning Applications on Low-energy Systems (opens in a new tab)

  15. Efficient Processing of Spiking Neural Networks: A Memory-Based Approach

    … more state variables, which introduces a serious memory overhead in terms of memory operations (read/write), runtime memory requirement, and the utilization of hierarchical hardware memory. This memory overhead degrades the SNNs’ processing efficiency and increases their hardware cost. In other …

    trento Repository record for Efficient Processing of Spiking Neural Networks: A Memory-Based Approach (opens in a new tab)

  16. New data analysis and dimensionality reduction methods for hyperspectral imagery

    … reduction in computational complexity and memory requirement, and can extract many more features. Finally, F-LDA is applied on optimal spectral features selected by Genetic Algorithms. Results show that a novel combination of GA and F-LDA can achieve further reduction in computational …

    strathclyde Repository record for New data analysis and dimensionality reduction methods for hyperspectral imagery (opens in a new tab)

  17. Scalable compiler optimizations for improving the memory system performance in multi- and many-core processors

    … (or optimizing) compiler is to improve the memory system performance of the source program. This is particularly important because the multi-cores have accentuated the memory-wall and the bandwidth-wall.In this thesis, we identify three key challenges facing the compiler developers on …

    umn Repository record for Scalable compiler optimizations for improving the memory system performance in multi- and many-core processors (opens in a new tab)

  18. Fast and efficient analysis of finite large arrrays

    … is employed and developed to largely reduce the memory requirement and computational cost, which makes it possible to analyze very large array problems with full-wave method in personal computers. In this thesis, multilayered planar arrays and waveguide slot arrays are studied using the P-FFT …

    nus Repository record for Fast and efficient analysis of finite large arrrays (opens in a new tab) Download file for Fast and efficient analysis of finite large arrrays (opens in a new tab)

  19. Anwendung der Monte-Carlo-Methoden zur Lösung spezieller Probleme des Photonentransports

    … precision, numerical effectiveness, as well as memory requirement were optimised and verified by the calculations done. The modification and enhancement can be easy realised thanks to modular, object orientated implementation of the program and enables development of new application fields in …

    qucosa-diss

  20. Efficient layout-aware statistical analysis for photonic integrated circuits

    … computational times by 98.9% and a reduction in memory requirement by 72%. For the worst case, i.e. the 16x16 ring matrix, we observe a decrease in computational times by 99.8% and a reduction in memory requirement by 87%.

    ubc Repository record for Efficient layout-aware statistical analysis for photonic integrated circuits (opens in a new tab) Download PDF for Efficient layout-aware statistical analysis for photonic integrated circuits (opens in a new tab)

Page 1 of 8