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 31 for “"distance problem"”.

  1. Erdős distance problem in the hyperbolic half-plane

    The Erd̋os distance problem asks for the minimum number of distinct distances determined by large finite point sets in the plane. The aim of this work is to investigate how the classical techniques employed in the study of the Erdős distance problem carry over to the hyperbolic half-plane.

    missouri Repository record for Erdős distance problem in the hyperbolic half-plane (opens in a new tab)

  2. Optimal transport approximation of measures via lower-dimensional structures : principal manifolds and the average distance problem

    We study two variational problems encoding the idea of optimally approximating a probability measure $\rho$ via a lower-dimensional set $\Sigma$ of bounded complexity. In both problems we quantify the performance of $\Sigma$ in approximating $\rho$ via the average of the …

    ubc Repository record for Optimal transport approximation of measures via lower-dimensional structures : principal manifolds and the average distance problem (opens in a new tab) Download PDF for Optimal transport approximation of measures via lower-dimensional structures : principal manifolds and the average distance problem (opens in a new tab)

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

    We study a variety of combinatorial distance and dot product related problems in vector spaces over finite fields. First, we focus on the generation of the Special Linear Group whose elements belong to a finite field with q elements. Given A [subset of] Fq, we use Fourier analytic methods to …

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

  4. Short Tandem String Duplication Sequences

    … work shows that the Tandem Duplication Distance Problem (TDDP) is NP-complete for alphabets of size five. Therefore, we study the idea of overlapping squares and introduce a new algorithm, which solves the k-TD problem in time O((n log n)k), where n denotes the length of the target …

    chalmers Repository record for Short Tandem String Duplication Sequences (opens in a new tab)

  5. Elliptical bounds, robustness, and performance in control system design

    … weighting matrices for sensitivity minimization problems. An <i>H<sup>∞</sup></i> optimization problem is presented which provides a method of synthesizing controllers satisfying these requirements based on the solution of the general distance problem.</p>

    ut-knoxville Repository record for Elliptical bounds, robustness, and performance in control system design (opens in a new tab)

  6. On the Discrete Number of Tree Graphs

    We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible …

    vt Repository record for On the Discrete Number of Tree Graphs (opens in a new tab)

  7. Development of a MASH TL-3 Low-Profile Concrete Barrier

    A sight-distance problem is associated with use of 32-inch tall concrete longitudinal barriers, specifically in certain work zone locations and at nighttime. These 32-inch tall barriers can obstruct drivers’ eyesight, making it difficult for drivers to detect oncoming vehicles on the other side of …

    tamu Repository record for Development of a MASH TL-3 Low-Profile Concrete Barrier (opens in a new tab)

  8. Distance determination algorithms for convex and concave objects

    Determining the minimum distance between two objects is a problem that has been solved using many different approaches. Most methods proposed so far are, in essence, limited to solve the problem amongst convex polyhedra. Thus, to deal with concave objects, these methods partition concave objects …

    uvic Repository record for Distance determination algorithms for convex and concave objects (opens in a new tab)

  9. ΜΙΑ ΠΡΟΤΑΣΗ ΓΙΑ ΝΕΕΣ ΠΡΟΔΙΑΓΡΑΦΕΣ ΜΕΛΕΤΗΣ ΔΑΣΙΚΩΝ ΔΡΟΜΩΝ

    … SIZE OF THE CROSS- SECTION. STUDY OF THE SIGHT DISTANCE PROBLEM GIVING TABLES AND ESTIMATION MODEL OF THE RELATIVE LENGTHS AND THE EFFECTS ON THE FORMATION OF FOREST ROADS. DETERMINATION OF THE PARAMETERS AND ESTIMATION OF THE DATA AFFECTING THE STUDY WHICH REFERS TO THE HORIZONTAL AND THE …

    greece Repository record for ΜΙΑ ΠΡΟΤΑΣΗ ΓΙΑ ΝΕΕΣ ΠΡΟΔΙΑΓΡΑΦΕΣ ΜΕΛΕΤΗΣ ΔΑΣΙΚΩΝ ΔΡΟΜΩΝ (opens in a new tab)

  10. Optimal Point Sets With Few Distinct Triangles

    … extension of a variant of the distinct distance problem put forward by ErdH{o}s and Fishburn cite{ErdosFishburn}.

    vt Repository record for Optimal Point Sets With Few Distinct Triangles (opens in a new tab)

  11. Distance problems and points on curves : an algebraic approach

    … this thesis we give results on unit and rational distances, structure results for surfaces containing many points of a cartesian product and a survey of various, mainly combinatorial, applications of the Subspace Theorem. We take an algebraic approach to most of the problems and use techniques …

    ubc Repository record for Distance problems and points on curves : an algebraic approach (opens in a new tab) Download PDF for Distance problems and points on curves : an algebraic approach (opens in a new tab)

  12. The Mattila-Sjölin Problem for Triangles

    … at least $frac{(d+1)}{2}$ then its set of distances has nonempty interior. In this dissertation, we present a similar result, namely that if a compact subset $E$ of $mathbb{R}^d$, with $d geq 3$, has a large enough Hausdorff dimension then the set of congruence classes of triangles formed …

    vt Repository record for The Mattila-Sjölin Problem for Triangles (opens in a new tab)

  13. Approximate controllability and observability measures in control systems design

    … structure selection rely on criteria expressing distance from uncontrollability (unobservability). The thesis introduces novel measures for evaluating and estimating the distance to uncontrollability and relatively unobservability. At first, the modal measuring approach is studied in detail, …

    city-london Download PDF for Approximate controllability and observability measures in control systems design (opens in a new tab)

  14. Models and Algorithms for Sorting Permutations with Tandem Duplication and Random Loss

    … evolutionary biology and optimization. Many problems of phylogeny inference can be formulated as challenging combinatorial optimization problems which makes this research area especially interesting for computer scientists. The most prominent examples of such optimization problems are the …

    qucosa-diss

  15. Analysis of the necklace algorithm and its applications

    A commonly studied problem in the field of cryptography is the Discrete Logarithm Problem. This problem is also referred to as the "distance" problem. Basically, one would like to know where a particular binary n-tuple is in a list combining all of them, represented as powers of some primitive …

    nps Repository record for Analysis of the necklace algorithm and its applications (opens in a new tab)

  16. ERES Methodology and Approximate Algebraic Computations

    … (LCM) of a set of polynomials are challenging problems that arise from several applications in applied mathematics and engineering. Several methods have been proposed for the computation of the GCD of polynomials using tools and notions either from linear algebra or linear systems theory. …

    city-london Download PDF for ERES Methodology and Approximate Algebraic Computations (opens in a new tab)

  17. Extremal problems in combinatorics and geometry

    … theory. In Chapter 2, we study the Erdős unit distance problem. In particular, we prove a structural result for pointsets determining many unit distances from a small direction set in any norm. Then, we use this to deduce that, in the Euclidean norm, such pointsets cannot exist. In chapter 3, …

    ubc Repository record for Extremal problems in combinatorics and geometry (opens in a new tab) Download PDF for Extremal problems in combinatorics and geometry (opens in a new tab)

  18. Strategies for automating open pit mine haulage planning

    … to facilitate solutions to haulage planning problems in the areas of economic modeling, haul road placement and fleet estimation by automating the process of generating haulage profiles and calculating cycle times. The traditional mine planning process produces ultimate pit and pushback …

    must-thes Repository record for Strategies for automating open pit mine haulage planning (opens in a new tab)

  19. Settling the complexity of the k-disjointness and the k-Hamming distance problems

    … the communication complexity of two related problems, the $k$-Hamming distance and $k$-disjointness and give tight bounds to both of these problems: The $r$-round communication complexity of the $k$-disjointness problem is $\Theta(k\log^{(r)}k)$, whereas a tight $\Omega(k\log k)$ bound holds …

    washington Repository record for Settling the complexity of the k-disjointness and the k-Hamming distance problems (opens in a new tab)

  20. Progress in projection theory and other dimensional developments

    … Chapter 4. The first application is on Beck-type problems, first studied in the discrete setting by József Beck in 1983 and in the continuum setting by Orponen, Shmerkin, and Wang in 2022. Given X ⊂ Rⁿ, these problems seek to understand how large the set of lines that contain at least 2 points of …

    ubc Repository record for Progress in projection theory and other dimensional developments (opens in a new tab) Download PDF for Progress in projection theory and other dimensional developments (opens in a new tab)

Page 1 of 2