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 1998 for “"Perfect"”.

  1. Perfect Love, Perfect Selfishness

    auckland-tech

  2. Process makes perfect

    This thesis presents a software architecture for developing art and design tools that automatically capture the artist's interaction and records the entire creative process. The software uses the artist's interaction with the digital medium as its true data-type and streams the data to a database. …

    mit Repository record for Process makes perfect (opens in a new tab)

  3. A more perfect union.

    A More Perfect Union is a realistic novel set in contemporary Oklahoma City and follows Elijah McClure, a young poker pro who wishes to ask the First Daughter of Oklahoma, Kathryn Cook, to marry him the night her father gets elected president. Eli's plans of proposing to Kate are interrupted, …

    central-ok Repository record for A more perfect union. (opens in a new tab)

  4. Identifying Perfect Nonlocal Games

    … algebraic characterization of games with a “perfect” commuting operator strategy, i.e. games with a winning correlation that can be produced exactly by commuting operator measurements. This characterization is built on a key result in non-commutative algebraic geometry known as a …

    mit Repository record for Identifying Perfect Nonlocal Games (opens in a new tab)

  5. Perfect clustering from pairwise comparisons

    We consider a pairwise comparisons model with n users and m items. Each user is shown a few pairs of items, and when a pair of items is shown to a user, he or she expresses a preference for one of the items based on a probabilistic model. The goal is to group users into clusters so that users …

    uiuc Repository record for Perfect clustering from pairwise comparisons (opens in a new tab)

  6. Perfect hashing and related problems

    … a dictionary to a hash table with collisions, a perfect hash function maps the words in a dictionary to a hash table with no collisions. Thus, perfect hashing is a special case of hashing, in which a find operation takes 𝑂(1) time in the worst case, and an insert or a delete operation takes 𝑂(1) …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  7. Perfect binary codes: classification and properties

    An r-perfect binary code is a subset of ℤ2n such that for any word, there is a unique codeword at Hamming distance at most r. Such a code is r-error-correcting. Two codes are equivalent if one can be obtained from the other by permuting the coordinates and adding a constant vector. The main result …

    aalto Repository record for Perfect binary codes: classification and properties (opens in a new tab)

  8. Singularities of the Perfect Cone Compactification

    … object taken into consideration consists of the perfect cone (also known as first Voroni) compactification of arithmetic quotients of type IV domains. These are of importance in the context of algebraic geometry because they are used to construct moduli spaces of polarised K3 surfaces and are …

    qucosa-diss

  9. Picture Perfect: Predicting the Model Ex-Offender

    The cost of imprisonment remains high. Budgetary constraints faced by most states have resulted in an increased interest in reducing prison populations while simultaneously reducing recidivism rates. The latter goal has encouraged a renewed interest in offender reentry and reintegration. There are …

    unr Repository record for Picture Perfect: Predicting the Model Ex-Offender (opens in a new tab)

  10. Perfect Recovery in Heterogeneous Stochastic Bicluster Models

    … transitions, identifying critical thresholds for perfect recovery of the planted structure. In the noiseless regime, i.e., when all inter-cluster edges carry negligible or zero weight, the semidefinite relaxation is exact whenever the graph contains k large, dense, disjoint bicliques. When noise …

    alabama Repository record for Perfect Recovery in Heterogeneous Stochastic Bicluster Models (opens in a new tab)

  11. Circuits, Perfect Matchings and Paths in Graphs

    … shall present a series of conjectures related to perfect matching covering and point out their relationship.;In last chapter, we shall introduce the saturation number, in contrast to extremal number (or known as Turan Number), and describe the edge spectrum of saturation number for small paths, …

    wvu Repository record for Circuits, Perfect Matchings and Paths in Graphs (opens in a new tab)

  12. Synesthesia and Perfect Pitch: A Possible Connection?

    <p>Synesthesia -- the mixing of senses -- and perfect pitch -- auditary recognition of a musical pitch -- are two separate phenomena, ways of experiencing the world. These perceptions have been misunderstood for many years. They have bugged psychologists for ages, and scientific breakthroughs have …

    ohiolink Repository record for Synesthesia and Perfect Pitch: A Possible Connection? (opens in a new tab)

  13. The pullback closure, perfect morphisms and completions

    … notions such as compactness of objects and perfectness of morphisms to abstract categories. The categorical theory of factorisation structures for families of morphisms which developed in the 1970's laid the foundation for an axiomatic theory of categorical closure operators. This theory …

    cape-town Repository record for The pullback closure, perfect morphisms and completions (opens in a new tab)

  14. Chemisorption on Perfect Surfaces and Structural Defects

    Made available in DSpace on 2014-12-14T16:00:34Z (GMT). No. of bitstreams: 1 7804073.pdf: 11727424 bytes, checksum: 8b66830e712c7af5f8265f1b75d4d38c (MD5) Previous issue date: 1977

    uiuc Repository record for Chemisorption on Perfect Surfaces and Structural Defects (opens in a new tab)

  15. History of the perfect periphrases in Greek.

    cambridge

  16. Orders of Perfect Groups with Dihedral Involution Centralizers

    Let G be a finite group that is equal to its commutator subgroup, and suppose that G contains an element of order 2 whose centralizer in G is dihedral of 2-power order. We study the cases where this centralizer is dihedral of order 8, 16, 32, 64, 128, or 256. It is true in each case that this …

    ohiolink Repository record for Orders of Perfect Groups with Dihedral Involution Centralizers (opens in a new tab)

Page 1 of 100