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 210 for “"Approximation Techniques"”.
-
Approximation techniques in network information theory
… in the presence of noisy feedback. The key approximation technique used to complete this task is the so-called {linear deterministic model}. It is found that when the feedback link strengths exceed certain thresholds, the performance of the interference channel starts to improve. The second …
-
Approximation techniques for the Stefan problem
… one space dimension, the thesis develops three approximation methods to solve these equations. (a) Asymptotic Expansions With the Green's functions to suit the given boundary conditions, the system can be transformed into a set of integral equations. For the case where the initial phase grows …
-
Annular Capillary Surfaces: Properties and Approximation Techniques
The capillary surface formed within a symmetric annular tube is analyzed. Assuming identical contact angles along each boundary, we consider surfaces u(x,y) that satisfy the capillary problem on an annular region. Several qualitative properties of u are determined and in particular, the behaviour …
-
Approximation Techniques for Incompressible Flows with Heterogeneous Properties
We study approximation techniques for incompressible flows with heterogeneous properties. Speci cally, we study two types of phenomena. The first is the flow of a viscous incompressible fluid through a rigid porous medium, where the permeability of the medium depends on the pressure. The second is …
-
Moment approximation techniques for compartmentalised stochastic reaction networks
… infinite size, requiring ad-hoc moment closure approximations to be employed, which can be difficult to derive in practice. In this thesis I first present how the formalism of stochastic reaction networks, together with its computational techniques, can be applied to model the structure of the …
-
Approximation Techniques for Large Finite Quantum Many-body Systems
… challenging. The Shifted Harmonic Approximation (SHA) developed here gives good predictions of properties such as ground state energies, excitation energies and the most probable states in the lowest eigenstates. This is achieved by solving only a system of k equations and …
-
Cross-layer approximation techniques for synthesis and optimization of machine learning accelerators
… computing (axc) principles. We propose automated approximation methodologies such that the energy efficiency of ml accelerators is improved, whilst their reliable operation is guaranteed. Our methodologies comply with given accuracy bounds, thus ensuring application quality, whilst targeting …
-
Joint resource allocation and routing in wireless networks via convex approximation techniques
… in the DSL literature, we use successive convex approximation strategies to approximate it, and come up with efficient centralized algorithms that provide approximate solutions to the BPPC problem. Our extensive simulation results prove that our proposed solutions deliver manifold improvements in …
-
Exploring Per-Input Filter Selection and Approximation Techniques for Deep Neural Networks
We propose a dynamic, input dependent filter approximation and selection technique to improve the computational efficiency of Deep Neural Networks. The approximation techniques convert 32 bit floating point representation of filter weights in neural networks into smaller precision values. This is …
-
Integrating constraint awareness and multiple approximation techniques in high-level synthesis for FPGAs
… numerous approximate computing (AC) techniques have been developed to reduce design costs in error-resilient application domains, such as signal and multimedia processing, data min ing, machine learning, and computer vision, to trade-off computation accuracy with area and power …
-
Unbalanced Analysis of Variance Comparing Standard and Proposed Approximation Techniques for Estimating the Variance Components
… unbalanced nested design and compares standard techniques with proposed approximation procedures. Current procedures are complicated and assume the unbalanced sample size to be fixed. This paper tests some simpler techniques, assuming sample sizes are random variables. Monte Carlo techniques …
-
From circuits to SoC processors: arithmetic approximation techniques and embedded computing methodologies for DSP acceleration
… paradigm of Approximate Computing and apply new approximation techniques in the design of arithmetic circuits. Based on our methodology, these arithmetic approximation techniques are then combined with hardware design techniques to implement approximate ASIC- and FPGA-based DSP and AI …
-
Deriving patterns from animal movement decisions: a comparison of approximation techniques and a continuous-time resource selection method
… using three partial differential equation (PDE) techniques on analysing some simple animal movement models. Results of examining a biased random walk show that an old approach from Patlak’s work in 1953 can give a very poor approximation even in this very simple case, while more recent methods …
-
Dynamics of a Small Autonomous Underwater Vehicle That Tows a Large Payload
… must be fully modeled. Furthermore, several approximation techniques based on analytic and empirical formulations are investigated for computing the hydrodynamic coefficients of the vehicle. Efficacy and limitations of the approximation techniques are assessed by comparison with hydrodynamic …
-
Inexact subgradient methods.
… programs are usually based on functional approximation techniques, or statistical applications of subgradient methods. In this dissertation, we explore algorithms by combining functional approximation techniques with subgradient optimization methods. This class of algorithms is referred to …
-
An algebraic approach to multivariate approximation
… method for the study of certain multivariate approximation techniques is developed and examined. This method, introduced by Gordon [8], employs the properties of a distributive lattice ψ M generated by a set of linear projection operators {P<sub>m}<sup>M</sup><sub>m=1</sub>. ψ has a maximal …
Page 1 of 11