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 12708 for “"Approximate"”.

  1. Implementing approximate voronoi diagrams for approximate nearest neighbor searching

    Η αναζήτηση πλησιέστερου γείτονα είναι ένα θεμελιώδες πρόβλημα στην Επιστήμη των Υπολογιστών. Ένα άπο τα κύρια θεωρητικά ζητήματα ειναι η εξισορρόπηση του χρόνου που απαιτείται για να απαντήσει η δομή σε ερωτήματα και η χωρική πολυπλοκότητά της: η πρόσφατη μελέτη στο Προσεγγιστικό Διάγραμμα …

    athens Repository record for Implementing approximate voronoi diagrams for approximate nearest neighbor searching (opens in a new tab)

  2. APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers

    … it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough …

    uiuc Repository record for APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers (opens in a new tab)

  3. Approximate Similarity Reduction

    … equation with damping is investigated via the approximate homotopy symmetry method and approximate homotopy direct method. The approximate homotopy symmetry and homotopy similarity reduction equations of different orders are derived and the corresponding homotopy series reduction solutionsare …

    gsu Repository record for Approximate Similarity Reduction (opens in a new tab)

  4. Approximate String Matching

    … implementations in practice. Second, we cover approximate string matching in bidirectional indices. To improve the running time and make higher error rates suitable for index-based searches, we introduce an integer linear program for finding optimal search strategies. We show that it is …

    fu-berlin Repository record for Approximate String Matching (opens in a new tab)

  5. Approximate reinsurance premiums

    Insurance is a risk transfer mechanism, which allows individuals and firms to reduce the uncertainty about their future cash flows. It provides financial compensation for the effects of misfortune through the establishment of a fund, into which all insured pay premiums and from which benefits are …

    concordia Download PDF for Approximate reinsurance premiums (opens in a new tab)

  6. Blind Image Deconvolution using Approximate Greatest Common Divisor and Approximate Polynomial Factorisation

    … a BID method for image restoration based on the approximate greatest common divisor (AGCD) algorithms, specifically, the approximate polynomial factorization (APF) algorithm of two polynomials. The developed method uses the Sylvester resultant matrix algorithm in the computation of the AGCD and …

    whiterose Download PDF for Blind Image Deconvolution using Approximate Greatest Common Divisor and Approximate Polynomial Factorisation (opens in a new tab)

  7. Recklessly approximate sparse coding

    … soft threshold features and shows that even very approximate solutions to the sparse coding problem are sufficient to build effective classifiers.

    ubc Repository record for Recklessly approximate sparse coding (opens in a new tab) Download PDF for Recklessly approximate sparse coding (opens in a new tab)

  8. Approximate inference in astronomy

    This thesis utilizes the rules of probability theory and Bayesian reasoning to perform inference about astrophysical quantities from observational data, with a main focus on the inference of dynamical systems extended in space and time. The necessary assumptions to successfully solve such inference …

    lmu-germany Repository record for Approximate inference in astronomy (opens in a new tab)

  9. Multi-Resolution Approximate Inverses

    … the sparsity vs. quality problem of standard approximate inverses. This finally allows the approximate inverse approach to scale well, giving fast convergence for Krylov subspace accelerators on a wide variety of large unstructured problems. Implementation details are discussed, including …

    waterloo Repository record for Multi-Resolution Approximate Inverses (opens in a new tab)

  10. Approximate Private Quantum Channels

    … a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for &epsilon;-randomizing maps, <em>n</em> + 2log(1/&epsilon;) + <em>c</em> bits required to &epsilon;-randomize an arbitrary <em>n</em>-qubit state by improving a scheme of …

    waterloo Repository record for Approximate Private Quantum Channels (opens in a new tab)

  11. Securing Approximate Computing Systems

    Approximate Computing (AC) techniques have been leveraged to improve computing performance and energy efficiency with minor degradation in accuracy. Different than conventional computing, AC allows the computation to deviate from the reference or deterministic execution behavior. Thus, AC has …

    unh-thes Repository record for Securing Approximate Computing Systems (opens in a new tab)

  12. COMPUTING APPROXIMATE CUSTOMIZED RANKING

    … of an exact solution (IdealRank) and an approximate solution (ApproxRank) for computing ranking on a subgraph. Both IdealRank and ApproxRank represent the set of external pages with an external node $\Lambda$ and modify the PageRank-style transition matrix with respect to $\Lambda$. The …

    maryland Repository record for COMPUTING APPROXIMATE CUSTOMIZED RANKING (opens in a new tab)

  13. Fast Approximate Convex Decomposition

    Approximate convex decomposition (ACD) is a technique that partitions an input object into "approximately convex" components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of …

    tamu Repository record for Fast Approximate Convex Decomposition (opens in a new tab)

  14. Multi-Layer Approximate Computing

    Approximate computing can efficiently trade accuracy for power savings, thus optimizing the power for applications that don't require exact solutions. This tradeoff has been studied in recent years across several implementation technologies, but mostly focused on approximations on a specific system …

    carleton Repository record for Multi-Layer Approximate Computing (opens in a new tab)

  15. Computing approximate Nash equilibria

    … normal-form games, making the task of finding approximate Nash equilibria one of the central questions in the area of equilibrium computation. In this thesis our main goal is a new study of the complexity of various variants of the approximate Nash equilibrium. Specifically, we study algorithms …

    greece Repository record for Computing approximate Nash equilibria (opens in a new tab)

  16. Approximate Analysis of Domes

    Made available in DSpace on 2015-05-12T17:06:21Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 0019866.PDF: 2686995 bytes, checksum: cfdbfb9ecdb82908055a3bac9f99f36f (MD5) Previous issue date: 1956

    uiuc Repository record for Approximate Analysis of Domes (opens in a new tab)

  17. Approximate Data Analytics Systems

    … law predictions. To overcome this problem, approximate computing has recently emerged as a promising solution. Approximate computing is based on the observation that many modern applications are amenable to an approximate, rather than the exact output. Unlike traditional computing, …

    qucosa-diss

  18. Approximate representations of groups

    In this thesis, we consider various notions of approximate representations of groups. Loosely speaking, an approximate representation is a map from a group into the unitary operators on a Hilbert space that satisfies the homomorphism equation up to a small error. Maps that are close to actual …

    qucosa-diss

  19. Memory-centric approximate computing

    Made available in DSpace on 2020-08-26T23:58:45Z (GMT). No. of bitstreams: 2 WANG-THESIS-2020.pdf: 767488 bytes, checksum: f279727e3637c38ea03e13ef0926d1a7 (MD5) LICENSE.txt: 4210 bytes, checksum: b0afabfe300d734e5c194fcc53c0a560 (MD5) Previous issue date: 2020-05-12

    uiuc Repository record for Memory-centric approximate computing (opens in a new tab)

Page 1 of 636