Results 121 to 130 of about 86,434 (167)
Comparative Study of Distributed Acoustic Sensing Responses in Telecommunication Optical Cables. [PDF]
Abushagur AAG +8 more
europepmc +1 more source
Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference. [PDF]
Song B +5 more
europepmc +1 more source
Finite element and <i>in vitro</i> biomechanical analysis of a novel magnesium degradation-induced variable fixation plate. [PDF]
Wen J +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Maximal Spacing Configurations in Graphs
Combinatorics, Probability and Computing, 1997Subsets of given cardinality of vertices of a fixed graph are sought which maximize two dispersion measures: the average over the chosen vertices of their average (resp. minimal) distance to all other chosen vertices. Complete descriptions of optimal solutions for both cases are obtained for any cycle-graph.
Firby, Peter, Haviland, Julie
openaire +1 more source
ON CONFIGURATION GRAPH AND PARADOXICAL DECOMPOSITION
Journal of Algebra and Its Applications, 2013In this paper, we introduce the concept of configuration graph and show how one can use this notion to simplify the theorem proved by Rejali and Yousofzadeh [Configuration of groups and paradoxical decompositions, Bull. Belg. Math. Soc. Simon Stevin18 (2011) 157–172].
Yousofzadeh, Akram +2 more
openaire +1 more source
Configurable Graph Reasoning for Visual Relationship Detection
IEEE Transactions on Neural Networks and Learning Systems, 2022Visual commonsense knowledge has received growing attention in the reasoning of long-tailed visual relationships biased in terms of object and relation labels. Most current methods typically collect and utilize external knowledge for visual relationships by following the fixed reasoning path of {subject, object → predicate} to facilitate the ...
Yi Zhu +6 more
openaire +2 more sources
I-graphs and the corresponding configurations
Journal of Combinatorial Designs, 2005Summary: We consider the class of \(I\)-graphs \(I(n,j,k)\), which is a generalization over the class of the generalized Petersen graphs. We study different properties of \(I\)-graphs, such as connectedness, girth, and whether they are bipartite or vertex-transitive.
Boben, Marko +2 more
openaire +1 more source
Two-Dimensional Critical Point Configuration Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984The configuration of the critical points of a smooth function of two variables is studied under the assumption that the function is Morse, that is, that all of its critical points are nondegenerate. A critical point configuration graph (CPCG) is derived from the critical points, ridge lines, and course lines of the function.
openaire +3 more sources

