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 19 of 19 for “"symmetric difference"”.

  1. Characterizations of the symmetric difference and the structure of stone algebras

    Thesis (Ph. D.)--Michigan State University of Agriculture and Applied Science. Department of Mathematics, 1958

    msu Repository record for Characterizations of the symmetric difference and the structure of stone algebras (opens in a new tab)

  2. Embeddings of Product Graphs Where One Factor is a Hypercube

    … is a hypercube, describing some minimal and symmetrical embeddings. We then define a graph product, the weak symmetric difference, and illustrate a voltage graph construction useful for obtaining an embedding of the weak symmetric difference of an arbitrary graph with a hypercube.

    vcu Repository record for Embeddings of Product Graphs Where One Factor is a Hypercube (opens in a new tab)

  3. P-algebras and Q-algebras

    … The birth of P-algebras is based on the symmetric difference in set theory. We prove that the class of P-algebras is a variety, and the definition of P-algebras is an alternative definition for groups of exponent 2, which we call P-groups. The class of Q-algebras consists of a combination …

    alabama Repository record for P-algebras and Q-algebras (opens in a new tab)

  4. APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHI NG

    … considered, where the distance function is the symmetric difference. A randomized embedding into real space under the L<sub>1</sub> metric is given. The algorithm achieves an expected distortion of O(log<super>2</super> n). Second, an algorithm is given for embedding R<super>d</super> under the …

    maryland Repository record for APPROXIMATION ALGORITHMS FOR POINT PATTERN MATCHING AND SEARCHI NG (opens in a new tab)

  5. Probabilistic matching of solid shapes in arbitrary dimension

    … Throughout this work, the volume of the symmetric difference is used as distance measure for the matching problem. Maximizing the volume of the overlap is equivalent to minimizing the volume of the symmetric difference under translations and rigid motions. We study a probabilistic …

    fu-berlin Repository record for Probabilistic matching of solid shapes in arbitrary dimension (opens in a new tab)

  6. The edit distance function: Forbidding induced powers of cycles and other questions

    … vertex set is defined to be the size of the symmetric difference of the edge sets. The edit distance between a graph, $G$, and a graph property, $\mathcal{H}$, is the minimum edit distance between $G$ and a graph in $\mathcal{H}$. The edit distance function of a graph property $\mathcal{H}$ …

    iastate Repository record for The edit distance function: Forbidding induced powers of cycles and other questions (opens in a new tab)

  7. On Reconfiguration Problems: Structure and Tractability

    … are adjacent in R(S) whenever the size of their symmetric difference is equal to one. Clearly, this graph contains 2^n vertices and can be easily encoded in poly(n) bits using the oracle described above. It is not hard to see that there exists a path between any two vertices of R(S). Moreover, …

    waterloo Repository record for On Reconfiguration Problems: Structure and Tractability (opens in a new tab)

  8. Finite point configurations and projection theorems in vector spaces over finite fields

    … greater than s₀, then the Lebesgue measure of [symmetric difference] (E) is positive. A generalization of the Erdős-Falconer distance problem in vector spaces over finite fields is to determine the minimal [alpha] [greater than] 0 such that E contains a congruent copy of every k dimensional …

    missouri Repository record for Finite point configurations and projection theorems in vector spaces over finite fields (opens in a new tab)

  9. Connectivity of Matroids and Polymatroids

    … every cocircuit in the basis, as well as the symmetric difference of all these cocircuits, has precisely three elements.

    lsu-thes Repository record for Connectivity of Matroids and Polymatroids (opens in a new tab)

  10. Efficient Evaluation of Set Expressions

    … optimal for inputs with union, intersection, and symmetric difference operators. One of the algorithms we provide also supports minus and complement operators and is conjectured to be optimal when an input is allowed to contain these operators as well. We also provide a worst-case optimal …

    waterloo Repository record for Efficient Evaluation of Set Expressions (opens in a new tab)

  11. Distributions on bicoloured evolutionary trees : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University

    … Toward the first theme, the distribution of the symmetric difference metric on pairs of binary and phylogenetic trees is studied, and a number of new results obtained. These theorems, as well as a result on another tree metric answer previous conjectures in this area. Also under the theme of …

    massey Repository record for Distributions on bicoloured evolutionary trees : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University (opens in a new tab)

  12. Nonparametric curve estimation and applications

    … on a variance-reducing linear combination of symmetric difference quotients. We establish the asymptotic properties of the proposed derivative estimators and propose fast tuning methods to select parameters. We compare the proposed estimators with popular estimators for derivative estimation …

    iastate Repository record for Nonparametric curve estimation and applications (opens in a new tab)

  13. Εξακρίβωση παραμέτρων και αλγοριθμική κατασκευή μορφοκλασματικών συναρτήσεων παρεμβολής: Εφαρμογές στον ψηφιακό εικονισμό και την οπτικοποίηση

    … identification that are based on minimising the symmetric difference between bounding volumes of appropriately chosen points, achieving lower errors compared to existing methods. Furthermore, we present a novel method that aims at preserving the fractal dimension of the initial set of points. …

    greece Repository record for Εξακρίβωση παραμέτρων και αλγοριθμική κατασκευή μορφοκλασματικών συναρτήσεων παρεμβολής: Εφαρμογές στον ψηφιακό εικονισμό και την οπτικοποίηση (opens in a new tab)

  14. Hrushovski and Ramsey Properties of Classes of Finite Inner Product Structures, Finite Euclidean Metric Spaces, and Boron Trees

    … graphs -- metric spaces on sets with the symmetric difference metric -- satisfies the Hrushovski property up to 3 points, but not more. Moreover, the amalgamation in this class can be too restrictive to permit the Ramsey Property. Finally, following the work of Fouche, we compute the …

    toronto-retro Repository record for Hrushovski and Ramsey Properties of Classes of Finite Inner Product Structures, Finite Euclidean Metric Spaces, and Boron Trees (opens in a new tab)

  15. Shape Matching in Higher Dimensions

    … for example, the Hausdorff distance, the area of symmetric difference, or especially for curves the turn-angle distance, or the Fréchet distance. The application usually supplies a distance measure, and furthermore a set of allowed transformations, and the task is to find a transformation that, …

    fu-berlin Repository record for Shape Matching in Higher Dimensions (opens in a new tab)

  16. Minimal Classes of Unbounded Clique-Width

    … subgraphs of an infinite graph created from the symmetric difference of edges between an infinite path and a partition of the path vertices forming infinite cliques or independent sets that are complete or anti-complete to each other. We identify another uncountable family of minimal classes …

    the-open-u Download PDF for Minimal Classes of Unbounded Clique-Width (opens in a new tab)

  17. Evolutionary ancestor inference via genome rearrangement

    … is simply the sum over the tree branches of the symmetric difference between the two sets of intervals associated with the genomes at the two ends of the branch. To achieve this goal, we use dynamic programming optimization to determine the presence of common intervals at the ancestral nodes of …

    ottawa-retro Repository record for Evolutionary ancestor inference via genome rearrangement (opens in a new tab)