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 8 of 8 for “"Maximum clique"”.
-
Maximum Clique in Geometric Intersection Graphs
… corresponding to the items that intersect. The maximum clique in a geometric intersec- tion graph is the largest mutually intersecting set of objects. In this thesis, the primary focus is to study the maximum clique in various geometric intersection graphs. We develop three results motivated by …
-
Graph-Theoretic Outlier Rejection: From Instance to Category-Level Perception
… existing results showing that the inliers form a clique in this graph and typically belong to the maximum clique. We also provide a general definition of invariance for noisy measurements. We test ROBIN in various instance-level perception problems such as single rotation averaging and 3D point …
-
Even-hole-free graphs
… and m edges, there are at most n+2m maximal cliques. It also yields a fastest known algorithm for computing a maximum clique in an even-hole-free graph. Afterwards we prove the main result of this thesis. The result is a decomposition theorem for even-hole-free graphs, that uses star cutsets …
-
Essays on Social Networks
… an infinitely repeated game. In particular, the maximum clique of the network defines favouritism behaviour that is coalition-proof where no group of individuals have incentives to deviate collectively. While aggregate surplus increases with network connectivity, it decreases with the number of …
-
Network Based Approaches for Clustering and Location Decisions
… of results in topics including finding maximum cliques in large graphs, graph clustering in large scale graphs, determining location of facilities for pre-positioning emergency relief supplies, and selecting nodes to form a virtual backbone in a wireless sensor network. To begin with, a …
-
Polynomial and indefinite quadratic programming problems: algorithms and applications
… in various other mathematical models such as the maximum clique problem and the jointly constrained bilinear programming problem. The proposed algorithm is more than just a specialization of the polynomial programming approach; it involves new, nontrivial extensions that exploit the particular …
-
Three Essays on High-Frequency and High-Dimensional Financial Data Analysis
… realized-skewness, realized-kurtosis, maximum daily return, and illiquidity.</p><p>In Chapter 3, co-authored with Professor Tim Bollerslev and Professor Viktor Todorov, we provide a new framework for estimating the systematic and idiosyncratic jump tail risks in the financial asset …
-
Algorithms and algorithmic obstacles for probabilistic combinatorial structures
… problems: Large Submatrix Selection, Maximum Cut (Max-Cut) of a graph and Matrix Completion. The Large Submatrix Selection problem is to find a k x k submatrix of an n x n matrix with i.i.d. standard Gaussian entries, which has the largest average entry. It was shown in [13] using …