Results 241 to 250 of about 2,728,736 (277)
Some of the next articles are maybe not open access.
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
SIAM Journal on Computing, 1980Let $G = (V,E)$ be an undirected graph in which no vertex has degree more than d. Let $|V| = n^q = 2^q $ . In this paper we present an $O(q^3 (q + d)n\log n)$ algorithm to find the connected components of G on a q-dimensional $n \times n \times \cdots \times n$ mesh-connected parallel computer.
Sartaj Sahni
exaly +3 more sources
On the Performance of Connected Components Grouping
International Journal of Computer Vision, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Berengolts, Michael Lindenbaum
openaire +1 more source
Optimization of Component Connections for an Embedded Component System
2009 International Conference on Computational Science and Engineering, 2009Software component techniques are widely used to enhance productivity and reduce the cost of software systems development. This paper proposes optimization of component connections for a component system that is suitable for embedded systems. This component system adopts a static model that statically instantiates and connects components.
Takuya Azumi +2 more
openaire +1 more source
Connected-component stereo aggregation
2010 IEEE Asia Pacific Conference on Circuits and Systems, 2010Stereo vision algorithms can be divided into several general stages. Detailed analysis on each specific stage allows focused improvement of the entire algorithm. Existing stereo vision algorithms typically prioritize pixel and sub-pixel accuracy, focusing on the optimization stage, while commercial algorithms which prioritize real-time operation ...
Oon-Ee Ng +2 more
openaire +1 more source
Fast connected-component labeling
Pattern Recognition, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lifeng He +3 more
openaire +1 more source
Markov connected component fields
Advances in Applied Probability, 1996A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. For these models the neighbourhood of a pixel is not fixed as for Markov random fields, but is given by the components which are adjacent to the pixel.
Møller, J., Waagepetersen, Rasmus
openaire +5 more sources
2004
Algorithms are considered for the external connected-components problem. The main contribution is an algorithm which for a graph with n nodes and m edges has an expected running time bounded by O(m · loglog n) when randomizing the node indices. A blocked version of this algorithm, which is perfectly suited for external application, handles bundles of W
openaire +1 more source
Algorithms are considered for the external connected-components problem. The main contribution is an algorithm which for a graph with n nodes and m edges has an expected running time bounded by O(m · loglog n) when randomizing the node indices. A blocked version of this algorithm, which is perfectly suited for external application, handles bundles of W
openaire +1 more source
On the Simple Connectivity of Fatou Components
Acta Mathematica Sinica, English Series, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, Chun Lei, Wang, Yue Fei
openaire +2 more sources
On Component Connectivity of Hierarchical Star Networks
International Journal of Foundations of Computer Science, 2020For an integer [Formula: see text], the [Formula: see text]-component connectivity of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices whose removal from [Formula: see text] results in a disconnected graph with at least [Formula: see text] components or a graph with fewer than [Formula: see text] vertices.
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
openaire +1 more source
On Connected Components of Shimura Varieties
Canadian Journal of Mathematics, 2002AbstractWe study the cohomology of connected components of Shimura varieties coming from the group GSp2g, by an approach modeled on the stabilization of the twisted trace formula, due to Kottwitz and Shelstad. More precisely, for each character ϖ on the group of connected components of we define an operator L(ω) on the cohomology groups with compact ...
openaire +1 more source