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 19 of 19 for “"Precomputation"”.
-
Secure Intermittent Computing: Precomputation and Implementation
… to precompute security related operations. Precomputation powered by this excess energy can reduce the cost of expensive tasks during periods of energy scarcity, potentially enabling the use of expensive security operations on traditionally unsecured devices. Second, when energy is limited …
-
Precomputation-based sequential logic optimization for low power
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.
-
Methods enabling interactive customization of fabricable objects by non-professionals
… my solution separates Fab Form evaluation into a precomputation stage and a runtime stage. Parts of the geometry and design validity (such as manufacturability) are evaluated and stored in the precomputation stage by adaptively sampling the design space. At runtime the remainder of the evaluation …
-
Fast and scalable solvers for the Helmholtz equation
… expensive but embarrassingly parallel precomputation performed only once; and an online stage, a highly parallel computation with low complexity performed for each right-hand side. The computational efficiency of the algorithms is achieved by shifting most of the computational burden to …
-
Enhancements to Hierarchical Pathfinding Algorithms
… refining the same abstract edge. In the precomputation step we calculate the low-level paths for all of the edges in the abstraction and directly access the data during online search. We also applied the weighted A* algorithm for online abstract pathfinding and show that the search speed …
-
Vector occluders: an empirical approximation for rendering global illumination effects in real-time
Precomputation has been previously used as a means to get global illumination effects in real-time on consumer hardware of the day. Our work uses Sloan’s 2002 PRT method as a starting point, and builds on it with two new ideas. We first explore an alternative representation for PRT data. “Cpherical …
-
Compressed absorbing boundary conditions for the Helmholtz equation
… low rank matrices. The result, modulo a precomputation, is a fast and memory-efficient compression scheme of an absorbing boundary condition for the Helmholtz equation.
-
Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration
… application workload (LAW) abstraction to enable precomputation of the required relative positioning of an application's virtual machines (VMs) and allocation of these VMs in a single atomic step, leading to online algorithms that are one order of magnitude faster than existing solutions for …
-
Simulation of human motion data using short-horizon model-predictive control
… games and training simulations. It requires no precomputation and little manual tuning. The controller is resilient to mismatches between the character dynamics and the input motion, which allows it to track motion capture data even where the real dynamics are not known precisely. The same …
-
Surplus and Scarce Energy: Designing and Optimizing Security for Energy Harvested Internet of Things
… in both energy scenarios. First, we propose precomputation, an optimization technique, that utilizes the surplus energy. We study two cryptographic applications, namely bulk encryption and true random number generation, and we show that precomputing improves energy efficiency and algorithm …
-
FPGA-aided MAV vision-based estimation
… and descriptors are transmitted. This onboard precomputation greatly reduces bandwidth usage and ground station processing. The objectives of this research are (1) to show how the raw computing power of an FPGA can be exploited in this application and (2) to evaluate the performance of such a …
-
Static and dynamic virtual channel allocation for high performance, in-order communication in on-chip networks
… VC allocation assigns channels to flows by precomputation when oblivious routing is used, and ensures deadlock freedom for arbitrary minimal routes when two or more VCs are available. EDVCA, on the other hand, is done at runtime, not requiring knowledge of traffic patterns or routes in …
-
TRUSTED RUNTIME ENVIRONMENTS FOR EMBEDDED SYSTEMS: FROM MEMORY PROTECTION TO SECURE VIRTUALIZATION
… vulnerabilities. The approach relies on a precomputation analysis to identify a minimal set of control-flow checkpoints that encapsulate sequences of pointer operations. Instrumentation at these semantically meaningful points reduces runtime and communication overhead. A remote verifier …
-
A hybrid global surrogate modeling software for nuclear reactor cross section estimation
… increase per unit time invested during this precomputation step. Unlike previous work in the reactor simulation field, this methodology does not limit the number and type of runtime simulation inputs. NUDGE (NUclear Database GEneration software) is an implementation of this methodology. The …
-
Space-Efficient and Noise-Robust Quantum Factoring
… space and size without requiring significant precomputation, a result that may be useful for other quantum algorithms. A key ingredient of our exponentiation implementation is an efficient circuit for a function resembling in-place quantum-quantum modular multiplication. This implementation …
-
Bayesian Network Inference Using Marginal Trees
… Compared to VE and a variant of VE incorporating precomputation, our approach fairs favourably in experimental results.
-
Sampling Methods in Ray-Based Global Illumination
… comparatively low memory overhead, little precomputation, and the ability to sample all three terms of the direct lighting equation. Finally, the third part of the dissertation discusses sampling algorithms in the context of general global illumination. In this part, we develop two new …
-
Multiphase Fluid-Material Interaction: Efficient Solution Algorithms and Shock-Dominated Applications
… without introducing approximations or offline precomputation tasks. The basic idea is to exploit some special properties of the Riemann problem equations, and to recycle previous solutions as much as possible. Following this idea, four acceleration methods are developed. The performance of …
-
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