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 60 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 …
-
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 …
-
Detection of Stroke, Blood Vessel Landmarks, and Leptomeningeal Anastomoses in Mouse Brain Imaging
… of finding collateral connections is utilizing connected components. Connected components organize all adjacent pixels into a group. All collateral connections can be found on the border of two neighboring arterial flow regions, and belong to the same group of connected components with the …
-
Plectic arithmetic of Hilbert modular varieties
… actions on the set of CM points, on the set of connected components, and on the set of cocharacters of Shimura varieties that differ in the centre from the Hilbert modular variety. By allowing the centre to vary, we extend the plectic framework of Nekovář--Scholl to include such Shimura …
-
Contour Extraction of Drosophila Embryos Using Active Contours in Scale Space
… a framework for contour extraction based on the connected components in the gaussian scale space of an embryonic image. The active contour model is applied on the images to refine embryo contours. Data cleaning methods are applied to smooth the jaggy contours caused by blurred embryo boundaries. …
-
Automatic classification of multi-lingual documents
… projection profiles, height distributions of connected components (CC) and enclosing structure of connected components. Experimental results show that we are able to classify the script of a document as either European or Asian based on four 50-CCs and obtain a high recognition rate while …
-
Efficient parallel computation on multiprocessors with optical interconnection networks
… transitive closure and their applications to connected component problems. We implement an optimal sorting algorithm on an n-processor LARPBS. With this optimal sorting algorithm at disposal, we study the sorting problem for higher dimensional LARPBS's and obtain the following results: • An …
-
Surfaces Isogenous to a Product: Their Automorphisms and Degenerations
… singuarities are unobstructed and get some connected components of the moduli space of stable surfaces.
-
An Automatic Framework for Embryonic Localization Using Edges in a Scale Space
… localization framework based on the analysis of connected components of edge pixels in a scale space. We propose criteria to select optimal scales for embryonic localization. Furthermore, we propose a scale mapping strategy to compress the range of a scale space in order to improve the efficiency …
-
GT-shadows related to finite quotients of the full modular group
… braid group B3 on 3 strands. We explore the connected components of GTSh for sub- groups of B3 coming from the standard homomorphism from B3 to SL2(Z/qZ), where q is a power of an odd prime integer > 3.
-
Improving the Performance of Parallel SPARQL Query Processing on Apache Spark Using Bloom Filters
… a large RDF dataset. In that study, we computed connected components in large RDF datasets followed by indexing groups of those connected components on different machines in the cluster. However, such an approach yields poor performance when the queries are highly selective and produce results …
-
Problems Related to the Zermelo and Extended Zermelo Model
… in terms of specific types of strongly connected components. Following this, the idea of stability of a tournament will be discussed and an upper bound will be obtained on the stability of three-team tournaments. Finally, we will conclude with some partial results related to the topics …
-
Excluding a Weakly 4-connected Minor
A 3-connected graph $G$ is called weakly 4-connected if min $(|E(G_1)|, |E(G_2)|) \leq 4$ holds for all 3-separations $(G_1,G_2)$ of $G$. A 3-connected graph $G$ is called quasi 4-connected if min $(|V(G_1)|, |V(G_2)|) \leq 4$. We first discuss how to decompose a 3-connected graph into quasi …
-
Processing biomedical images for the study of treatments related to neurodegenerative diseases
… techniques. Notions such as the definition of connected components, or others related to the persistence homology and zigzag persistence theory have been used to compute the synaptic density or to recognise the neuronal structure. In addition, machine learning methods are used to determine …
-
A semantic checkpoint framework for enabling runtime-reconfigurable applications
… view applications here as a collection of inter-connected components, and reconfigurations as the reconstitution of components that make up an application. By checkpointing only values that are deemed to be of semantic significance, application state is maintained across reconfigurations even if …
-
Edge Labelings on the Partially Ordered Set of Non-Crossing Bonds
… A bond of G is a spanning subgraph of G whose connected components are induced. This collection of bonds form a partially ordered set which is also a lattice. This lattice has what is known as an ER-labeling. We explore a new subposet of this lattice which we call the “non-crossing bond poset” …
-
Region detection and labeling of images in real-time using an FPGA-based custom computing platform
Region detection can be defined as identifying connected components in an image. Connected component labelling is an important part of performing feature extraction. Industrial applications performing online image analysis may require a real-time implementation of a region labelling algorithm …
-
A study of three-edge connectivity algorithms - Refinement and implementation
… a number of linear algorithms to compute 3-edge connected components of a multi-graph. In this thesis, we study the three most efficient algorithms and exclude other algorithms that are obviously inferior as they use different types of transformation in multiple phases. We present a data …
Page 1 of 3