Results 1 to 10 of about 2,393,702 (209)

A region-level graph labeling approach to motion-based segmentation

open access: greenProceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2002
This paper deals with the problem of motion-based segmentation of image sequences. Such partitions are multiple-purpose in dynamic scene analysis. We first extract a spatial texture-based partition using an unsupervised MRF approach. The regions obtained
Marc Gelgon, Patrick Bouthémy
openalex   +3 more sources

Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph

open access: yesMathematics, 2018
A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with
Juan L. G. Guirao   +3 more
doaj   +2 more sources

GLaRA: Graph-based Labeling Rule Augmentation for Weakly Supervised Named Entity Recognition [PDF]

open access: yesConference of the European Chapter of the Association for Computational Linguistics, 2021
Instead of using expensive manual annotations, researchers have proposed to train named entity recognition (NER) systems using heuristic labeling rules.
Xinyan Zhao, Haibo Ding, Z. Feng
semanticscholar   +1 more source

Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography

open access: yesJambura Journal of Mathematics, 2021
Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu   +2 more
doaj   +1 more source

Polygonal Graceful Labeling of Some Simple Graphs

open access: yesRatio Mathematica, 2022
Let  be a graph with vertices and edges.  Let andbe the vertex set and edge set of respectively.  A polygonal graceful labeling of a graph  is an injective function , where  is a set of all non-negative integers that induces a bijection , where  is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj   +1 more source

An Algorithmic Approach for Encryption using Graph Labeling

open access: yesJournal of Physics: Conference Series, 2021
In the recent computerized world, cryptography plays an important role so as to transfer information safely between at least two substances. Cryptography consists of two parts, one is encryption of the message so that the cypher text will not reveal the ...
P. Amudha, J. Jayapriya, J. Gowri
semanticscholar   +1 more source

ODD HARMONIC LABELING ON Cm,n ⊵e C4 GRAPH

open access: yesJurnal Diferensial, 2023
Graph is an ordered pair of a vertex and edge set that related with various theories, one of them called labeling. There are a lot of types of graph labeling, one of them is odd harmonious labeling. The odd harmonious labeling is an injective function f :
Demetriana Kolo   +2 more
doaj   +1 more source

Novel classes of integers and their applications in graph labeling

open access: yes, 2021
Adding new classes of integers to literature is both challenging and charming. Until a new class is completely characterized, mathematics is never going to be worth it. While it's absurd to play with integers without intended consequences.
Shahbaz Ali, M. K. Mahmood, K. Shum
semanticscholar   +1 more source

GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks [PDF]

open access: yesThe Web Conference, 2023
Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation.
Zemin Liu   +3 more
semanticscholar   +1 more source

Extending of Edge Even Graceful Labeling of Graphs to Strong r-Edge Even Graceful Labeling

open access: yesJournal of Mathematics, 2021
Edge even graceful labeling of a graph G with p vertices and q edges is a bijective f from the set of edge EG to the set of positive integers 2,4,…,2q such that all the vertex labels f∗VG, given by f∗u=∑uv∈EGfuvmod2k, where k=maxp,q, are pairwise ...
Mohamed R. Zeen El Deen, Nora A. Omar
doaj   +1 more source

Home - About - Disclaimer - Privacy