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 7 of 7 for “"Isometrics (Mathematics)"”.

  1. Asymptotic unconditionality in Banach spaces

    We show that a separable real Banach space embeds almost isometrically in a space [Upsilon] with a shrinking 1-unconditional basis if and only if lim [subscript n] [subscript arrow] [subscript infinity] [norms] [chi] [group of units] [plus][chi] [group of units] [subscript n] [norms] [equals] lim …

    missouri Repository record for Asymptotic unconditionality in Banach spaces (opens in a new tab)

  2. Approximate isometries and distortion energy functionals

    A fundamental problem in Riemannian Geometry and related areas is to determine whether two diffeomorphic compact Riemannian manifolds (M, [subscript g][subscript M]) and (N, [subscript g][subscript N]) are isometric; that is, if there exists a diffeomorphism h : M [arrow] N such that h[group of …

    missouri Repository record for Approximate isometries and distortion energy functionals (opens in a new tab)

  3. Distance preserving graphs

    "The computational complexity of exploring distance properties of large graphs such as real-world social networks which consist of millions of nodes is extremely expensive. Recomputing distances in subgraphs of the original graph will add to the cost. One way to avoid this is to use subgraphs where …

    msu Repository record for Distance preserving graphs (opens in a new tab)

  4. Urysohn ultrametric spaces and isometry groups.

    In this dissertation we study a special sub-collection of Polish metric spaces: complete separable ultrametric spaces. Polish metric spaces have been studied for quite a long while, and a lot of results have been obtained. Motivated by some of earlier research, we work on the following two main …

    unt Repository record for Urysohn ultrametric spaces and isometry groups. (opens in a new tab)

  5. Isometry and convexity in dimensionality reduction

    The size of data generated every year follows an exponential growth. The number of data points as well as the dimensions have increased dramatically the past 15 years. The gap between the demand from the industry in data processing and the solutions provided by the machine learning community is …

    gatech Repository record for Isometry and convexity in dimensionality reduction (opens in a new tab)

  6. Shape correspondences: local to global

    Finding correspondences between two or more shapes is a fundamental and still unsolved problem in computer graphics and computer vision. Typically, one is interested in finding correspondence between similar objects (e.g. shapes representing different four-legged animals) or deformed versions of …

    colo-mines Repository record for Shape correspondences: local to global (opens in a new tab)