Results 1  10
of
1,684,331
CONNECTED COMPONENTS
"... Recall the definition of connectedness (2.45 in [1]). Definition 1. Let (X, d) be a metric space. A subset E ⊆ X is called disconnected (or separated) if there exists nonempty A, B ⊂ E such that E = A ∪ B, and A ∩ B = A ∩ B = ∅. A subset is called connected if it is not disconnected. Example 2. In R ..."
Abstract
 Add to MetaCart
Recall the definition of connectedness (2.45 in [1]). Definition 1. Let (X, d) be a metric space. A subset E ⊆ X is called disconnected (or separated) if there exists nonempty A, B ⊂ E such that E = A ∪ B, and A ∩ B = A ∩ B = ∅. A subset is called connected if it is not disconnected. Example 2
A Strongly Connected Components
, 2009
"... 1. Find the strongly connected components in the following regulatory network, by running the strongly connected component algorithm in the lecture notes. For each gene, include the finishing time for the corresponding node in your answer, and indicate which gene leads to the discovery of each stron ..."
Abstract
 Add to MetaCart
1. Find the strongly connected components in the following regulatory network, by running the strongly connected component algorithm in the lecture notes. For each gene, include the finishing time for the corresponding node in your answer, and indicate which gene leads to the discovery of each
Hypercube Computing: Connected Components
 Department of Computer Science, University of Minnesota
, 1988
"... Several approaches to finding the connected components of a graph on a hypercube multicomputer are proposed and analyzed. The results of experiments conducted on an NCUBE hypercube are also presented. The experimental results support the analysis. ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Several approaches to finding the connected components of a graph on a hypercube multicomputer are proposed and analyzed. The results of experiments conducted on an NCUBE hypercube are also presented. The experimental results support the analysis.
Connected Components in Binary Images
, 1997
"... This paper presents a serial algorithm for labeling the connected components in a binary image. It differs from bracketmarking algorithms by recursively constructing an equivalence relation among the labels of connected components in the image, and is at least as timeefficient. Results from a s ..."
Abstract
 Add to MetaCart
This paper presents a serial algorithm for labeling the connected components in a binary image. It differs from bracketmarking algorithms by recursively constructing an equivalence relation among the labels of connected components in the image, and is at least as timeefficient. Results from a
Concurrent Determination of Connected Components
, 1998
"... The design is described of a parallel version of Tarjan's algorithm for the determination of equivalence classes. The algorithm uses binary semaphores to implement buffers with one consumer and many producers. It is applied to the determination of connected components in image processing. Exper ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The design is described of a parallel version of Tarjan's algorithm for the determination of equivalence classes. The algorithm uses binary semaphores to implement buffers with one consumer and many producers. It is applied to the determination of connected components in image processing
On the Performance of Connected Components Grouping
 IN WORKSHOP ON PERCEPTUAL ORGANIZATION IN COMPUTER VISION
, 1998
"... simulation on real image; 62 different objects; measure statistics; Grouping processes may benefit, computationally, from using simple algorithms as part of the grouping process. In this paper we consider an extremely fast grouping process, based on the common connected components algorithm, and ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
simulation on real image; 62 different objects; measure statistics; Grouping processes may benefit, computationally, from using simple algorithms as part of the grouping process. In this paper we consider an extremely fast grouping process, based on the common connected components algorithm
Finding Connected Components in Graphs
, 1996
"... In this paper, we describe our implementation of several parallel graph algorithms for finding connected components. Our implementation, with virtual processing, is on a 16,384processor MasPar MP1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, ..."
Abstract
 Add to MetaCart
In this paper, we describe our implementation of several parallel graph algorithms for finding connected components. Our implementation, with virtual processing, is on a 16,384processor MasPar MP1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22
Connected Components with Split and Merge
, 1991
"... The split and merge model is a reasonable method for architectureindependent programming of global image processing operations on parallel architectures. We con sider image connected from the point of view of this programming model, and develop split and merge algorithms that implement various co ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
connected components algorithms that have appeared in the literature. The al gorithms are implemented in two architectures independ ent languages we have developed, namely Apply and Adapt. Performance of the algorithms on the Sun, the Carnegie Mellon Warp, and the Camegie Mellon Nectar architectures
Results 1  10
of
1,684,331