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 37 for “"Counting problem"”.

  1. Singular Moduli and the Ideal Class Group

    … this, they related the question to a particular counting problem. We recap the developments of Gross-Zagier, Dorman, and Lauter-Viray before making progress on the remaining cases by considering a related counting problem.

    washington Repository record for Singular Moduli and the Ideal Class Group (opens in a new tab)

  2. Integrating Preservation Functions Into the Web Server

    … to recognize. In short, the Web suffers from a counting problem and a representation problem. Refreshing the bits, migrating from an obsolete file format to a newer format, and other classic digital preservation problems also affect the Web. As digital collections devise solutions to these …

    odu Repository record for Integrating Preservation Functions Into the Web Server (opens in a new tab)

  3. Distribution of integers with prescribed arithmetic structure and applications

    … structure and an application. These include a counting problem in Diophantine approximation, an asymptotic formula for the number of solutions to congruence's with certain arithmetic conditions, lower bounds on the number of smooth square-free integers in arithmetic progression, an estimate on …

    unsw Repository record for Distribution of integers with prescribed arithmetic structure and applications (opens in a new tab)

  4. Selmer Groups And Ranks Of Hecke Rings

    … to it as we vary the weight or level. This counting problem is equivalent to understanding the ranks of certain completed Hecke rings. Using the deep modularity results of Wiles, et al., we investigate these Hecke rings by studying the deformation theory of the residual representation …

    cornell Repository record for Selmer Groups And Ranks Of Hecke Rings (opens in a new tab)

  5. Parameterised algorithms for counting subgraphs, matchings, and monochromatic partitions

    Counting the number of solutions to a computational problem is at least as hard as deciding whether a solution exists. In fact, it is often much harder. However, in theory, as well as in practice, it is often of interest to determine the number of solutions to computational problems. In this …

    glasgow Download PDF for Parameterised algorithms for counting subgraphs, matchings, and monochromatic partitions (opens in a new tab)

  6. Discovering frequent weak XML patterns

    <P>PROBLEMS TO DISCOVER FREQUENT PATTERNS FROM A LARGE XML REPOSITORY HAVE ATTRACTED INCREASING RESEARCH ATTENTIONS IN RECENT YEARS. SUCH PROBLEMS BELONG TO THE CATEGORY OF UNORDERED AND INDUCED SUBTREE MINING PROBLEM FOR WHICH NO EFFICIENT AND COMPLETE ALGORITHM HAS BEEN PROPOSED SO FAR. IN THIS …

    nus Repository record for Discovering frequent weak XML patterns (opens in a new tab) Download file for Discovering frequent weak XML patterns (opens in a new tab)

  7. Communication Algorithms for Wireless Ad Hoc Networks

    … dissertation we look at the distributed trigger counting problem in the wireless ad hoc network setting. We present a deterministic algorithm for this problem which is communication efficient in terms of the the maximum number of messages received by any processor in the system.

    tamu Repository record for Communication Algorithms for Wireless Ad Hoc Networks (opens in a new tab)

  8. The threshold shortest path interdiction problem for critical infrastructure resilience analysis

    … solve the threshold shortest path interdiction problem, which we define as follows: Find a finite set of arcs to attack within a network such that the resulting shortest path from a given source node to a given destination is longer than a specified threshold. Ultimately we are concerned with …

    nps Repository record for The threshold shortest path interdiction problem for critical infrastructure resilience analysis (opens in a new tab)

  9. On Geometric Range Searching, Approximate Counting and Depth Problems

    In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching and orthogonal range searching and research into these problems has spanned …

    waterloo Repository record for On Geometric Range Searching, Approximate Counting and Depth Problems (opens in a new tab)

  10. A field theory approach to pion deuteron elastic scattering

    … treating the nucleons in this manner, the double-counting problem usually associated with pion multiple-seattering is avoided. The pion-deuteron T-matrix is written as a series expansion in terms of operators between one-nucleon states. The first two terms in the series are examined. The first …

    ubc Repository record for A field theory approach to pion deuteron elastic scattering (opens in a new tab) Download PDF for A field theory approach to pion deuteron elastic scattering (opens in a new tab)

  11. Stress ranges produced by stochastic loads

    … time histories if a satisfactory cycle counting method such as the rain-flow algorithm is available. A cost effective alternative is to assume a probability distribution of stress ranges and to use it to solve the cycle counting problem. The shapes of six commonly used distributions were …

    rice Repository record for Stress ranges produced by stochastic loads (opens in a new tab)

  12. AVERAGE SIZE OF 2-SELMER GROUPS OF JACOBIANS OF HYPERELLIPTIC CURVES OVER FUNCTION FIELDS

    … complete the picture by considering the similar problems in the function fields setting. Significantly, we develop a different method (compare to the one in the rational field setting) that could be seen as a generalization of the method used in [Ho.P. Quoc, Le Hung V. Bao, and Ngo B. Chau, …

    nus Repository record for AVERAGE SIZE OF 2-SELMER GROUPS OF JACOBIANS OF HYPERELLIPTIC CURVES OVER FUNCTION FIELDS (opens in a new tab) Download file for AVERAGE SIZE OF 2-SELMER GROUPS OF JACOBIANS OF HYPERELLIPTIC CURVES OVER FUNCTION FIELDS (opens in a new tab)

  13. Adaptive Range Counting and Other Frequency-Based Range Query Problems

    … range. The most basic such computation involves counting the number of points in a query range. Data structures that compute this function solve the well-studied range counting problem. We consider adaptive and approximate data structures for the 2-D orthogonal range counting problem under the …

    waterloo Repository record for Adaptive Range Counting and Other Frequency-Based Range Query Problems (opens in a new tab)

  14. Random surfaces and the Yang-Lee edge singularity

    … correspond to an exactly solvable critical dimer counting problem on the random surface in the infinite temperature limit. The results lead to a deepened insight into the problem of coupling minimal conformal field theories to random surfaces. In chapter 5 we will briefly outline a suggestion on …

    uiuc Repository record for Random surfaces and the Yang-Lee edge singularity (opens in a new tab)

  15. Diophantine Approximation on Planar Lines and Affine Subspaces

    … sums to prove various upper boundestimates for problems in analytic number theory. Each chapter represents the culmination of my work in a specific project. The first two projects treat problems in Diophantine approximation, and the final project deals with a lattice point counting problem. …

    unr Repository record for Diophantine Approximation on Planar Lines and Affine Subspaces (opens in a new tab)

  16. Approximation algorithms and inapproximability of partition functions of spin systems

    <p>Over the past 30 years, the study of counting problems has become an interesting and important work. The framework of counting problems can capture applications in diverse fields, such as graph colouring and homomorphism in graph theory, and the Ising and Potts model from statistical physics. In …

    oxford Repository record for Approximation algorithms and inapproximability of partition functions of spin systems (opens in a new tab)

  17. Sampling and Counting Graph Structures with Triangle Motifs

    … thesis focuses on the latter, specifically the problem of sampling and counting graph structures that incorporate triangle motifs. While efficient algorithms exist for sampling classical structures such as matchings, extending these methods to higher-order motifs remains an important challenge. …

    rit Repository record for Sampling and Counting Graph Structures with Triangle Motifs (opens in a new tab)

  18. Optimal Graph Streaming Algorithms and Further Advances in Modern Models of Computation

    … important to understand how core graph problems can be solved under tight resource constraints. As these datasets grow, traditional algorithms that assume random access to the input become increasingly infeasible. This thesis explores how to process massive graphs efficiently under …

    waterloo Repository record for Optimal Graph Streaming Algorithms and Further Advances in Modern Models of Computation (opens in a new tab)

  19. Asymptotic enumeration, cluster statistics, and limit laws for combinatorial structures

    … We consider the two broad cases that the counting sequence of C is either subexponential or expansive. The enumerative results of this work are concerned with the following specific setting. We want to asymptotically determine the number of (multi-)sets of total size n ∈ N and with N ∈ N …

    lmu-germany Repository record for Asymptotic enumeration, cluster statistics, and limit laws for combinatorial structures (opens in a new tab)

  20. Algebraic Approaches to State Complexity of Regular Operations

    … the theory of semigroups and monoids, many problems in this area can be simplified or completely reduced to combinatorial problems. We describe various algebraic techniques for attacking state complexity problems. We present a general method for constructing witness languages for operations …

    waterloo Repository record for Algebraic Approaches to State Complexity of Regular Operations (opens in a new tab)

Page 1 of 2