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 269 for “"Connected components"”.
-
Webpage rank using Bayes' rule and connected components
… first decomposes the webgraph into mutually disconnected sub-webgraphs, each called a connected component (CC) or simply a block. A Bayes' theorem based block-wise local PageRank computation and weighting scheme are then used to compute the final ranking vector of CCRank, which approximates the …
-
The structure of hypergraphs: clustering and connected components
… complex systems composed of numerous interacting components. Real-world networks often exhibit higher-order interactions—relationships that involve more than two entities. These interactions can be represented by hyperedges, and a network consisting of nodes and hyperedges is termed a hypergraph. …
-
An Efficient Connected Components Algorithm for Massively-Parallel Devices
… analyzing such an irregular algorithm, called Connected Components, and proposes an efficient algorithm, called ECL, which is faster than the existing CC algorithms on most tested inputs. Though atomic operations are fast, they can represent a bottleneck as these operations run serially and …
-
K-edge Connected Components in Large Graphs: An Empirical Analysis
… or clusters within these graphs, with k-edge-connected components emerging as an important method for finding well-connected communi- ties. Although there exist other techniques such k-plexes, k-cores, and k-trusses, they are known to have some limitations. This study delves into four existing …
-
Optimisation techniques for finding connected components in large graphs using GraphX
The problem of finding connected components in undirected graphs has been well studied. It is an essential pre-processing step to many graph computations, and a fundamental task in graph analytics applications, such as social network analysis, web graph mining and image processing. Recently, it has …
-
Scalable asynchronous connected components detection based on a parallel union-find algorithm
… Various parallel algorithms to detect and label connected components exist, many of which are optimized for a shared-memory environment. However, scientific and engineering applications today process large-scale graphs that do not fit in a single compute node. This calls for a highly scalable …
-
On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences
A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each pair of vertices u and v in H, there is a directed path from u to v and a directed path from v to u in H. A strongly connected component is said to be giant if it has linear size. We determine the …
-
Bounded connected components of polynomial lemniscates, polynomial approximations of Z-bar, and applications to torsional rigidity.
… may express the torsional rigidity of a simply connected and bounded Jordan domain by a variational form of the Hadamard type. In this manner, we discuss how symmetrization techniques may be exploited to provide further understanding of the torsional rigidity of various regions. Finally we …
-
Applying Hierarchical Contextual Parsing with Visual Density and Geometric Features to Typeset Formula Recognition
… (HCP): Hierarchical in terms of starting with connected components and building to the symbol level using visual, spatial, and contextual features of connected components. Once connected components have been segmented into symbols, a new set of spatial, visual, and contextual features are …
-
Word grouping in imaged documents using voronoi tessellation
… enables us to obtain neighbor relations between connected components. Based on the neighbor relations, the task of word extraction becomes the problem of selecting appropriate Voronoi edges separating connected components in the same word and then merging those components. For this purpose, we …
-
Scaling limist of critical directed graphs
The scaling limit of connected components in critical undirected random graphs has been well studied and shown to be universal between different critical models of undirected random graphs. Work by Goldschmidt and Stephenson has established the scaling limit of a the strongly connected components …
-
Topology building and random polygon generation
… research into a broader nesting problem, namely connected component nesting, beginning with the underlying concept of topology-building and a related issue of random polygon generation. Topology building is a process of structuring data. We develop a plane sweep al gorithm for building a …
-
Limit theorems and the Kontsevich-Zorich Cocycle
… element of SL(2,R). We apply our methods to all connected components of strata which exhibit a varying phenomenon for the sum of non-negative Lyapunov exponents. In genus 4, by work of Chen-Moller, eight connected connected components of strata exhibit varying Lyapunov exponents, and so we apply …
-
Analyzing distributions using a systematic programmable approach as persistent homology
… analysis is made possible through one of its components called a filtered simplicial complex, which is a sequence of nested simplicial complexes. With this, we can obtain our persistent π0 (gaps) which is the number of connected components, and also apply homology on the filtration to obtain …
-
Finite groups of small genus
… \(x\)\(_i\) ϵ \(G\)#, \(i\) = 1,...,\(r\)}. The connected components of \(H\)\(^i\)\(_r\)\(_,\)\(^n\)\(_g\)(\(G\)) are in bijection with braid orbits on ε\(_r\)(\(G\)). In this thesis we enumerate the connected components of \(H\)\(^i\)\(_r\)\(_,\)\(^n\)\(_g\)(\(G\)) in the cases where \(g\) …
-
Efficiently computing graph similarity and graph connectivity
… in distributed computing (distributed computing connected components, biconnected components, 2-edge-connected components). Firstly, we study Graph Edit Distance (GED) which is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a …
-
Coupling and unimodularity in stationary settings
… processes on topological groups. Foliations and connected components generated by point-shifts are studied, and the cardinality classification of connected components is generalized to unimodular groups.
Page 1 of 14