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 51 for “"Exact computation"”.

  1. Exact computation using extended-precision single-modulus residue arithmetic

    <p>We consider a means of error-free computation that overcomes well-known difficulties in using fixed word-length digital computers for solving ill-conditioned problems and for using numerically unstable algorithms. The technique uses extended-precision single-modulus residue arithmetic to perform …

    ut-knoxville Repository record for Exact computation using extended-precision single-modulus residue arithmetic (opens in a new tab)

  2. Value of information in decision systems

    … as well as in normative systems. Unfortunately, exact computation of VOIs in a general or in a dynamic decision model (DDM) is an intractable task. This dissertation first examines the properties and boundaries of VOI in DDMs, and then proposes an efficient method based on reusable sub-junction …

    nus Repository record for Value of information in decision systems (opens in a new tab) Download file for Value of information in decision systems (opens in a new tab)

  3. A Family of Matrix Representations of the Figure Eight Knot Group

    <p>An exact computation is given of a new 1-parameter family of <em>SL</em>(4<em>,</em>R) representations of the figure eight knot group.</p>

    ut-knoxville Repository record for A Family of Matrix Representations of the Figure Eight Knot Group (opens in a new tab)

  4. Exact polynomial system solving for robust geometric computation

    I describe an exact method for computing roots of a system of multivariate polynomials with rational coefficients, called the rational univariate reduction. This method enables performance of exact algebraic computation of coordinates of the roots of polynomials. In computational geometry, curves, …

    tamu Repository record for Exact polynomial system solving for robust geometric computation (opens in a new tab)

  5. Descriptions and Computation of Ultrapowers in L(R)

    The results from this dissertation are an exact computation of ultrapowers by measures on cardinals $\aleph\sb{n},\ n\in w$, in $L(\IR$), and a proof that ordinals in $L(\IR$) below $\delta\sbsp{5}{1}$ represented by descriptions and the identity function with respect to sequences of measures are …

    unt Repository record for Descriptions and Computation of Ultrapowers in L(R) (opens in a new tab)

  6. Statistical Inference of Phylogenetic Networks from Unlinked Bi-allelic Markers

    … the method was a polynomial-time algorithm for exact computation of the likelihood of a fixed species tree via integration over all possible gene trees for a given marker. Here we report on a method for Bayesian inference of phylogenetic networks from bi-allelic markers. Our method significantly …

    rice Repository record for Statistical Inference of Phylogenetic Networks from Unlinked Bi-allelic Markers (opens in a new tab)

  7. Convergence Rates for Stationary Distributions of Semistochastic Processes

    … state spaces. We also discuss a method of exact computation for the stationary distributions of a certain class of semistochastic processes. An important example to which we can apply our work concerns the modelling of the carbon content of an ecosystem.

    oklahoma-thes Repository record for Convergence Rates for Stationary Distributions of Semistochastic Processes (opens in a new tab) Restricted access

  8. Stochastic Search Genetic Algorithm Approximation of Input Signals in Native Neuronal Networks

    … without knowing the original input signal. The computational complexity of the problem is prohibitive for the exact computation. We propose to use a heuristic approach called Genetic Algorithm. Three algorithms are developed, based on the GA technique. The developed algorithms are tested on two …

    ottawa-retro Repository record for Stochastic Search Genetic Algorithm Approximation of Input Signals in Native Neuronal Networks (opens in a new tab)

  9. Topics in exact precision mathematical programming

    … dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct …

    gatech Repository record for Topics in exact precision mathematical programming (opens in a new tab)

  10. Energy savings techniques in out-of-order pipeline through value approximation of instructions with data dependencies

    … computing tolerates imprecision during computation, and it produces data values that are close to the actual outputs obtained from exact computation. From software to circuit level, approximate computing techniques have been applied across all computing domains. This study was carried …

    iastate Repository record for Energy savings techniques in out-of-order pipeline through value approximation of instructions with data dependencies (opens in a new tab)

  11. Epidemic Change Detection via Shifted Maximum Subarrays

    … mean over all possible segments. As a result, exact computation of the scan statistic involves $O(n^2)$ operations for a sequence of length $n$, which greatly limits its applicability to large datasets.In this work, we introduce a new computational framework based on the shifted maximum …

    arizona-thes Repository record for Epidemic Change Detection via Shifted Maximum Subarrays (opens in a new tab)

  12. Statistical and Computational Methodology for the Analysis of Forensic DNA Mixtures with Artefacts

    … Further, we develop methods for efficient and exact computation in a Bayesian network. An implementation of the model and methodology is available through the R package DNAmixtures.</p>

    oxford Repository record for Statistical and Computational Methodology for the Analysis of Forensic DNA Mixtures with Artefacts (opens in a new tab)

  13. Fast and exact evaluation of geometric predicates using graphics processing units

    … presents a major challenge in the field of computational geometry, since even carefully designed algorithms may fail due to round-off errors. While there has been research to develop exact geometric algorithms, the existing techniques so far can still be improved performance-wise. In this …

    brazil-ufv Repository record for Fast and exact evaluation of geometric predicates using graphics processing units (opens in a new tab)

  14. Performance of Ds/ssma Communications in Impulsive Channels (Nongaussian, Hard Limiter)

    … linear correlation receivers in such channels by exact computation of the average bit error probabilities of these two systems. It is seen that hard-limiting correlation receivers can offer substantial improvement over the conventional linear correlator when the additive non-Gaussian channel noise …

    uiuc Repository record for Performance of Ds/ssma Communications in Impulsive Channels (Nongaussian, Hard Limiter) (opens in a new tab)

  15. Statistical methods for binomial and Gaussian sequences

    … sequence problems. The first is a tree-based computational method for calculating the Poisson Binomial distribution function, which is the distribution of a sum of independent but not identically distributed Bernoulli random variables. Our proposed scheme is shown to be the fastest available …

    uiuc Repository record for Statistical methods for binomial and Gaussian sequences (opens in a new tab)

  16. Υπολογιστική γεωμετρία για καμπύλα αντικείμενα: διαγράμματα Voronoi στο επίπεδο

    … dissertation we examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean plane, given in parametric form. Pseudo-circles are closed curves, every pair of which has at most two …

    greece Repository record for Υπολογιστική γεωμετρία για καμπύλα αντικείμενα: διαγράμματα Voronoi στο επίπεδο (opens in a new tab)

  17. Discrete multistate coherent systems and the three modules theorem

    … These complex systems require a large amount of computation, and interaction among their components can make the exact computation of their reliabilities virtually impossible. The analyst may attempt to attack these problems by incorporating modules into the system. These modules facilitate the …

    ttu Repository record for Discrete multistate coherent systems and the three modules theorem (opens in a new tab)

  18. Medial Axis Approximation and Regularization

    … that hinder wide adoption of medial axis.First, exact computation of medial axis is very difficult. Hence, in practice medial axis is approximated discretely. Though abundant approximation methods exist, they are either limited in scalability, insufficient in theoretical soundness, or susceptible …

    wustl Repository record for Medial Axis Approximation and Regularization (opens in a new tab)

  19. Excited Nucleon and Delta Spectra From Lattice QCD

    … of the Laplacian operator, allowing for an exact computation of all-to-all propagators between the distilled source and sink operators. We are able to identify four low-lying states with continuum delta states.

    maryland Repository record for Excited Nucleon and Delta Spectra From Lattice QCD (opens in a new tab)

Page 1 of 3