Results 241 to 250 of about 2,522,495 (283)

Fast connected-component labeling

Pattern Recognition, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lifeng He, Kenji Suzuki, Kesheng Wu
exaly   +2 more sources

Markov connected component fields

Advances in Applied Probability, 1996
A 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
  +11 more sources

Proportional Component Order Network Connectivity

Communications on Number Theory and Combinatorial Theory, 2022
We introduce a new measure of network reliability related to the order of the largest component. This new connectivity measure considers a network to be operational if there is a component or order at least some fixed proportion, r, of the original order. Thus, the network is in a failure state if all components are sufficiently small.
Hanson, Nicholas, Shank, Nathan, Armbruster, Ashley, Di, Jiequi   +3 more
openaire   +1 more source

Connected Components

2022
Abstract Let us return to the configuration model of uncorrelated networks with a given degree distribution P(q) and exploit its local tree-likeness to explore basic structural features of these networks. The elements of the techniques that we use here were first implemented in graph theory (Pittel 1990; Molloy and Reed, 1995, 1998), and
Sergey N. Dorogovtsev, José F. F. Mendes   +1 more
openaire   +1 more source

Component Connectivity of Augmented Cubes

SSRN Electronic Journal, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qifan Zhang, Shuming Zhou, Eddie Cheng
openaire   +2 more sources

Component Edge Connectivity of Hypercubes

International Journal of Foundations of Computer Science, 2018
Fault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection network. The component edge connectivity is a generalization of the traditional edge connectivity.
Zhao, Shuli, Yang, Weihua, Zhang, Shurong, Xu, Liqiong   +3 more
openaire   +1 more source

Connected-component stereo aggregation

2010 IEEE Asia Pacific Conference on Circuits and Systems, 2010
Stereo 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 ...
Ng Oon-Ee, Velappa Ganapathy, S.G. Ponnambalam   +2 more
openaire   +1 more source

External Connected Components

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

Simulating Strongly Connected Components

1989
In this chapter we discuss the use of a special windowing technique to simulate the blocks within a strongly connected component (SCC). The algorithm presented splits the entire time-interval of interest into various time-slots or windows such that all pairs of signal-transitions take place entirely within one of these windows.
Vasant B. Rao, David V. Overhauser, Timothy N. Trick, Ibrahim N. Hajj   +3 more
openaire   +1 more source