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 2171 for “"Approximating"”.

  1. Approximating Constrained Tetrahedrizations

    … algorithm are proposed for the implementation of approximating constrained tetramerizations. Major data structures are designed to hold the incidence graph of the tetramerization. The algorithm developed consists of four stages: data conversion, finding intersection vertices, retetrahedrization, …

    texas-state Repository record for Approximating Constrained Tetrahedrizations (opens in a new tab)

  2. Approximating Fluid Queues

    A Fluid queue is a piecewise-linear stochastic process where the driving process is a continuous-time Markov chain. Fluid queues provide a model for a single continuous performance measure of a system in the presence of a random environment. Fluid queues have found a wide variety of applications …

    adelaide Repository record for Approximating Fluid Queues (opens in a new tab)

  3. Approximating Longest Path

    We investigate the computational hardness of approximating the longest path and the longest cycle in undirected and directed graphs on n vertices. We show that * in any expander graph, we can find (n) long paths in polynomial time. * there is an algorithm that finds a path of length (log2 L/ log …

    lund Repository record for Approximating Longest Path (opens in a new tab) Download PDF for Approximating Longest Path (opens in a new tab)

  4. Approximating Bayes: Inference and Modeling

    This thesis focuses on sources of error in modern Bayesian analysis and machine learning in the ``big data'' era. We develop new theoretical tools for analyzing and controlling different sources of error. Our work leads to new theory and methodology for providing performance guarantees for modern …

    toronto-retro Repository record for Approximating Bayes: Inference and Modeling (opens in a new tab)

  5. Inference for Approximating Regression Models

    The assumptions underlying the Ordinary Least Squares (OLS) model are regularly and sometimes severely violated. In consequence, inferential procedures presumed valid for OLS are invalidated in practice. We describe a framework that is robust to model violations, and describe the modifications to …

    penn Repository record for Inference for Approximating Regression Models (opens in a new tab)

  6. Approximating Properties of Data Streams

    In this dissertation, we present algorithms that approximate properties in the data stream model, where elements of an underlying data set arrive sequentially, but algorithms must use space sublinear in the size of the underlying data set. We first study the problem of finding all k-periods of a …

    purdue-thes Repository record for Approximating Properties of Data Streams (opens in a new tab)

  7. Non-Cartesian distributed approximating functional

    <p>Presented in this work is the Non-Cartesian Distributed Approximation Functional (NCDAF). It is a multi-dimensional generalization of the (one-dimensional) Hermite DAF that is non-separable and isotropic. Demonstrated here is an approximation method based on the NCDAF that can construct a …

    iastate Repository record for Non-Cartesian distributed approximating functional (opens in a new tab)

  8. Approximating Probability Distributions Using Moments

    <p> We study the problem of finding approximate significance points of random variables whose exact distributions are unknown or extremely complicated . We consider the case where at least the first three moments, and possibly the lower or upper endpoint of the distribution are known. </p> <p> The …

    mcmaster Repository record for Approximating Probability Distributions Using Moments (opens in a new tab)

  9. Approximating excursion distributions using regenerative processes

    The excursion distribution of stochastic processes is important in many applications and is an important object in probability theory. The excursion distributions are defined as the time between a u-level up-crossing and the following down-crossing of the same level. While the notion of the …

    lund Repository record for Approximating excursion distributions using regenerative processes (opens in a new tab) Download PDF for Approximating excursion distributions using regenerative processes (opens in a new tab)

  10. Geophysical Applications of Hermite Distributed Approximating Functionals

    The thesis is centered on the Hermite Distributed Approximating Functional (HDAF). The HDAF provides a controllable two-parameter delta sequence converging to the Dirac delta function with arbitrary accuracy. Under appropriate choice of parameters, the HDAF can be used 1) to approximate to a …

    houston Repository record for Geophysical Applications of Hermite Distributed Approximating Functionals (opens in a new tab)

  11. Approximating polygonal objects with deformable smooth surfaces

    We propose a method to approximate a polygonal object with adeformable smooth surface, namely the t-skin defined byEdelsbrunner for all 0< t < 1. We guarantee that they arehomeomorphic and their Hausdorff distance is at most \epsilon>0.This construction makes it possible for fully automatic, …

    nus Repository record for Approximating polygonal objects with deformable smooth surfaces (opens in a new tab) Download file for Approximating polygonal objects with deformable smooth surfaces (opens in a new tab)

  12. Approximating the shapley value and shapley interactions

    Although the behavior of agents is often led by self-interest, many environments pose an incentive for cooperation by accomplishing a task together and thus be compensated collectively. This naturally leads to the search of a payout mechanism that assigns to each agent a share of the collective …

    lmu-germany Repository record for Approximating the shapley value and shapley interactions (opens in a new tab)

  13. Optimizing and approximating eigenvectors in max-algebra

    This thesis is a reflection of my research in max-algebra. The idea of max-algebra is replacing the conventional pairs of operations (+,x) by (max, +). It has been known for some time that max-algebraic linear systems and eigenvalue-eigenvector problem can be used to describe industrial processes …

    birmingham Download PDF for Optimizing and approximating eigenvectors in max-algebra (opens in a new tab)

  14. Approximating Configuration Space Topology with Workspace Models

    Motion planning is an important problem in robotics which addresses the question of how to transition an actor between states in an environment subject to obstacles, kinematic, and other constraints. Exact motion planning is a computationally hard problem, which has prompted the popularity of …

    tamu Repository record for Approximating Configuration Space Topology with Workspace Models (opens in a new tab)

  15. On approximating transitivity and tractability of graphs

    In the general case, in a simple, undirected graph, the problems of finding the largest clique, minimum colouring, maximum independent set and minimum vertex cover are NP-hard. But, there exists some families of graphs, called perfect graphs, where these problems become tractable. One particular …

    colostate Repository record for On approximating transitivity and tractability of graphs (opens in a new tab)

Page 1 of 109