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 15 of 15 for “"Bounded Error"”.

  1. Shape Approximation of Printed Images in VLSI Design

    … which approach the original shape with tighter error restriction, are preferable. Many existing approximation algorithms produce a single approximate polygon per shape, utilizing two main approaches: piecewise linear fit with a fixed number of segments or bounded error, and identification of …

    uiuc Repository record for Shape Approximation of Printed Images in VLSI Design (opens in a new tab)

  2. Validation of a CFD Approach for Gas Turbine Internal Cooling Passage Heat Transfer Prediction

    … model of internal turbine cooling channels with bounded error allows for the identification of particular shortcomings of heat transfer correlations and provides a baseline for future CFD based exploration of internal turbine cooling concepts.</p>

    calpoly Repository record for Validation of a CFD Approach for Gas Turbine Internal Cooling Passage Heat Transfer Prediction (opens in a new tab)

  3. Parameter Identification and the Design of Experiments for Continuous Non-Linear Dynamical Systems

    … the assumptions made about the behavior of the error in the statistical model. In this presentation we describe how to approach this problem using a combination of statistical and mathematical theory with reliable computation. More specifically, we present a new approach to bounded error

    vt Repository record for Parameter Identification and the Design of Experiments for Continuous Non-Linear Dynamical Systems (opens in a new tab)

  4. Learned String Index Structures for In-Memory Databases

    … model to predict its location. Additionally, the bounded-error nature of RSS accelerates the last mile search and also enables a memory-efficient hash-table lookup accelerator. Second, we benchmark RSS against existing algorithms on several real-world string datasets and study its performance …

    mit Repository record for Learned String Index Structures for In-Memory Databases (opens in a new tab)

  5. Quantum speedups in query complexity

    … to show a new power 5 relationship between zero-error and bounded-error quantum query complexity. Finally, we characterize the total Boolean functions that exhibit exponential quantum speedups when their domain is restricted to an arbitrarily chosen set. We show that such a "sculpting" of a …

    mit Repository record for Quantum speedups in query complexity (opens in a new tab)

  6. Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems

    … regression problems can be carried out with bounded-error pre-conditioners. We also present conjectures regarding the running time of computing symmetric factorizations for Hankel matrices that imply faster-than-matrix-multiplication time algorithms for solving sparse poly-conditioned linear …

    gatech Repository record for Scalable, Efficient, and Fair Algorithms for Structured Convex Optimization Problems (opens in a new tab)

  7. Low-Power-Driven Synthesis Algorithms for Sequential and Combinational Circuits

    … compared to previous approaches and that it has bounded error. We report experimental results on each of our algorithm on a variety of combinational and sequential benchmark circuits.

    uiuc Repository record for Low-Power-Driven Synthesis Algorithms for Sequential and Combinational Circuits (opens in a new tab)

  8. Utility-based map reduction for ground and flight vehicle navigation

    … localization or loop-closing), which permits bounded-error navigation performance. A standard localization system must describe the entire operational environment in its place-recognition database. A standard pose-graph-based simultaneous localization and mapping (SLAM) system adds a new …

    mit Repository record for Utility-based map reduction for ground and flight vehicle navigation (opens in a new tab)

  9. Robust and Efficient Algorithms for Protein 3-D Structure Alignment and Genome Sequence Comparison

    … a series of sublinear time deterministic, zero-error and bounded-error randomized algorithms and we have obtained a series of separations about the power of sublinear time computations. This dissertation also discusses two genome sequence related problems. A probabilistic model is proposed for …

    uno Repository record for Robust and Efficient Algorithms for Protein 3-D Structure Alignment and Genome Sequence Comparison (opens in a new tab)

  10. Robust multi-group multicast beamforming design and antenna selection for massive MIMO systems

    … are available at the base station with a bounded error. In the first scenario, we formulate the robust multicast beamforming optimization problem to minimize the transmit power while the minimum required quality-of service (QoS) is met. We directly solve the formulated optimization …

    uoit Repository record for Robust multi-group multicast beamforming design and antenna selection for massive MIMO systems (opens in a new tab)

  11. The space around BQP

    … by the complexity class BQP, which stands for "bounded-error quantum polynomial time." We hope that quantum devices will be capable of the full power of BQP in the long term. However, quantum computers are difficult to build, so the experimental devices of the near future may be incapable of …

    mit Repository record for The space around BQP (opens in a new tab)

  12. Finite Sample Bounds and Path Selection for Sequential Monte Carlo

    … Markov kernels, target distribution) and the error of the resulting estimator. This limitation makes it difficult to compare SMC to other estimation methods and challenging to design efficient SMC algorithms from a theoretical perspective. </p><p>In this thesis, we provide conditions under …

    duke Repository record for Finite Sample Bounds and Path Selection for Sequential Monte Carlo (opens in a new tab)

  13. Automatic tailoring and cloth modelling for animation characters.

    … that has linear time complexity with a small bounded error is also presented. Secondly, a cloth pattern adjusting genetic algorithm is developed for automatic cloth fitting and retargeting. For the reason that that body shapes and proportions vary largely in character design, fitting and …

    bournemouth Repository record for Automatic tailoring and cloth modelling for animation characters. (opens in a new tab)

  14. Approximation Based Safety and Stability Verification of Hybrid Systems

    … we present two techniques for approximation, an error based technique which allows one to compute as precise an approximation as desirable in terms of a quantified error between the original and the approximate system, and a property based technique which takes into account the property being …

    uiuc Repository record for Approximation Based Safety and Stability Verification of Hybrid Systems (opens in a new tab)

  15. Recursive Algorithms for Set-Membership Estimation

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Recursive Algorithms for Set-Membership Estimation (opens in a new tab)