Results 231 to 240 of about 2,728,736 (277)
Hybrid Helmholtz-Helical Metamaterial for Broadband-Targeted Suppression of Substation Noise. [PDF]
Materials (Basel)Nie J +7 more
europepmc +1 more source
Development of an automated fruit classification system by using computer vision and deep learning. [PDF]
HardwareXMac TT +4 more
europepmc +1 more source
Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population. [PDF]
PLoS Comput BiolBokor Bleile Y +3 more
europepmc +1 more source
Hypercube computing: Connected components [PDF]
Journal of Supercomputing, 1989 The connected-components problem is used to illustrate the programming issues that arise when a multiple-instruction/multiple-data hypercube multicomputer is used. These issues include selection of algorithmic abstraction, problem partitioning and mapping, overlapping computation and communication, and load balancing.
Sartaj Sahni
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Component Connectivity of Augmented Cubes
SSRN Electronic Journal, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qifan Zhang +2 more
openaire +2 more sources
Component connectivity of the hypercubes
International Journal of Computer Mathematics, 2012The r-component connectivity κ r (G) of the non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q n for r=2, 3, …, n+1, and we classify all the corresponding optimal solutions.
Lih-Hsing Hsu +5 more
openaire +1 more source
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 +1 more
openaire +1 more source
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 +1 more
openaire +1 more source
Component Edge Connectivity of Hypercubes
International Journal of Foundations of Computer Science, 2018Fault 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.
Shuli Zhao +3 more
openaire +1 more source