Results 211 to 220 of about 828 (253)
UroFusion-X: a unified multimodal deep learning framework for robust diagnosis, subtyping, and prognosis of urological cancers. [PDF]
NPJ Digit MedXiao Y +5 more
europepmc +1 more source
An On-Device Edge AI Agent for Reference-Free Self-Diagnosis of Low-Cost Multi-Pollutant Sensors. [PDF]
Sensors (Basel)Wang Y, Wang T, Pan Y.
europepmc +1 more source
Context-Aware Semantic Localization with Adaptive Sensor Fusion Under Adverse Conditions. [PDF]
Sensors (Basel)Choi JH +7 more
europepmc +1 more source
Real-time sleep disorder monitoring design using dynamic temporal graphs with facial and acoustic feature fusion. [PDF]
Front Artif IntellPei F, Zhou Y, Fu Q, Zhou H.
europepmc +1 more source
Early-warning industrial fault detection based on physics-guided residual learning and calibrated CRNNs. [PDF]
Sci RepKhan A +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Aequationes Mathematicae, 2022
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +2 more
exaly +3 more sources
Graceful labeling and antimagic labeling are two significant topics in the domain of graph labelings, with outstanding conjectures which still remain unsolved. In this paper, the authors combine these two concepts to define a new labeling, called graceful antimagic labelings. Graceful antimagicness of some families of trees, cycles, and nearly complete
Mohammed Ali Ahmed +2 more
exaly +3 more sources
SIAM Journal on Algebraic Discrete Methods, 1985
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
This very interesting paper introduces the concept of graceful directed graphs as follows. A digraph D with e arcs is numbered by assigning a distinct integer value h(v) from \(\{\) 0,1,...,e\(\}\) to each node v. Each arc (u,v) receives a value \(h(u,v)=h(v)-h(u)\) (mod e\(+1)\).
Bloom, G. S., Hsu, D. F.
openaire +1 more source
Czechoslovak Mathematical Journal, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Mukti, Singh, Tarkeshwar
openaire +2 more sources
ODD GRACEFUL LABELINGS OF GRAPHS
Discrete Mathematics, Algorithms and Applications, 2009A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao +2 more
openaire +2 more sources