Results 61 to 70 of about 1,632,039 (225)
HeMIS: Hetero-Modal Image Segmentation
, 2016 We introduce a deep learning image segmentation framework that is extremely robust to missing imaging modalities. Instead of attempting to impute or synthesize missing data, the proposed approach learns, for each modality, an embedding of the input image
B Menze +10 more
core +1 more source
Improper Graceful and Odd-graceful Labellings of Graph Theory
, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Wang, Hongyu, Xu, Jin, Yao, Bing
openaire +2 more sources
, 2008 Dance, like most other art forms, is not intrinsically representational. In fact, the expressive, ritualistic or aesthetic dimensions have often had primacy over the referential over the course of its variegated history, and in much modern and ...
Bennett, Karen
core
Open Inflationary Universes in the Induced Gravity Theory
, 1996 The induced gravity theory is a variant of Jordan--Brans--Dicke theory where the `dilaton' field possesses a potential. It has the unusual feature that in the presence of a false vacuum there is a {\em stable} static solution with the dilaton field ...
A. D. Linde +29 more
core +1 more source
Graceful labeling on torch graph
Indonesian Journal of Combinatorics, 2018 Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V<span style="font-family: symbol;"> --> </span>{0,1,2,...,|E|} is called graceful labeling if f induces a function f<sup>*</sup>(uv)=|f(u)<span style="font-family: symbol;">-</span>f(v)| which is a bijection from E(G) to the ...
Jona Martinus Manulang, Kiki A. Sugeng
openaire +3 more sources
A distributed knowledge-based approach to flexible automation : the contract-net framework [PDF]
, 1987 Includes bibliographical references (p. 26-29)
Shaw, Michael, 1956- +1 more
core
Probing The Labelling and Isomorphic Graph of Generalized Fibonacci Caterpillar Tree
, 2016 “All trees are graceful” has not been proven. Applying the construction method to show every generalized Fibonacci caterpillar tree is a set-ordered odd graceful graph meanwhile every generalized Fibonacci caterpillar tree not only have an odd-elegant ...
Bei-bei Wang +3 more
semanticscholar +1 more source
Further Studies on the Sparing Number of Graphs [PDF]
, 2014 Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An integer additive set-indexer is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to ...
Germina, K A, Sudev, N K
core +2 more sources
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Entropy (Basel), 2023 Zhao M, Wang H, Yao B.
europepmc +1 more source