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 4825 for “"Counting"”.
-
Counting, modular counting and graph homomorphisms
… the problem #<sub>k</sub>HomsTo<em>H</em> of counting the homomorphisms from an input graph to a fixed undirected graph <em>H</em> modulo an integer <em>k</em>. A characteristic feature of counting modulo <em>k</em> is that the objects to be counted can be grouped in sets of size <em>k</em> …
-
Counting Bases
… problem, and includes the #P-complete problem of counting the number of perfect matchings in a bipartite graph. We focus on the problem of counting the common bases in pairs of regular matroids, and describe a class called <i>Pfaffian matroid pairs</i> for which this enumeration problem can be …
-
Counting Vessels
The discussion and illustration of how paintings function as thresholds is examined in the thesis report and the thesis exhibition, Threshold implies the passage of how an artist approaches the processes of seeing. The painting is the entry point, a place of connection of artist and viewer, a …
-
Counting coloured boxes
This thesis consists of the manuscripts of two research papers. In the first paper, we verify a recent conjecture of Kenyon/Szendroi by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the …
-
Counting partial objects
<p>In this thesis, I develop a theory of counting. Chapter 1 introduces the topic and explains why it is important to give a theory of counting whole and partial objects. Chapter 2 shows that giving a theory of counting is surprisingly difficult because counting has five special features: counting …
-
On parameterized counting
… analyze the intrinsic hardness of parameterized counting problems. We have analyzed the parameterized complexity of #W(P)-complete problems. We proved that, (under some complexity theoretic hypothesis): <br>1. Any #W(P)-complete is harder than any problem in the A hierarchy. <br>2. Any …
-
Preschool Children's Understanding of Counting: In Relationship to Gelman's Counting Principles
… investigated the application of two of Gelman's counting principles (Gelman & Gallistel, 1978; Gelman & Meck, 1983) using familiar and unfamiliar testing materials. The purposes of this study, therefore, were to identify the relationship between age and children's tendency to honor Gelman's …
-
Distributed trigger counting algorithms
… messages (sent and received) for the trigger counting problem in distributed computing. The report concludes with simulation results that compare the performance of the algorithms with respect to the total number of messages and MaxLoad messages required by each algorithm to detect when the …
-
B counting at BABAR
In this thesis we examine the method of counting BB events produced in the BaBar experiment. The original method was proposed in 2000, but improvements to track reconstruction and our understanding of the detector since that date make it appropriate to revisit the B Counting method. We propose a …
-
Counting X-free sets
Let X be a finite subset of the integers. A set A contained in [n]^d is X-free if it does not contain a copy of X, that is subset of the form b+r*X, for any r > 0 and b in the d-dimensional real numbers. Let r_X(n) denote the cardinality of the largest X-free subset of [n]^d. In this thesis we …
-
Packing and Counting Permutations
A permutation class is a set of permutations closed under taking subpermutations. We study two aspects of permutation classes: enumeration and packing. <br></br><br></br> Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to …
-
Scene adaptive crowd counting
We consider the problem of scene adaptive crowd counting. Given a target camera scene, our goal is to adapt a model to this specific scene with only a few labeled/unlabeled images. The solution to this problem has potential applications in numerous real-world scenarios that require deploying a …
-
Counting with limited supervision
<p>Counting is among the first abstract analysis tasks that we learn. It is the most fundamental way we can quantitatively understand data. From an early age, people are able to accurately count objects with minimal direction, even when the type of object to be counted is completely unknown. While …
Page 1 of 242