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"”.
-
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, …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
Approximating Rate Constants and Equilibrium Constants
No abstract prepared
-
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 …
-
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 …
-
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, …
-
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 …
-
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 …
-
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 …
-
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 …
Page 1 of 109