Zobrazeno 1 - 7
of 7
pro vyhledávání: '"D. Dafi"'
Autor:
Stephen V. Tracy, Th. Panagopoulos, P. Roussopoulos, M. Panagopoulos, Constantin Papaodysseus, D. Dafi, Dimitrios Fragoulis
Publikováno v:
Archaeometry. 49:749-764
In this paper, a novel methodology is introduced for the identification of the workmen (hands) that carved ancient inscriptions. This methodology employs specific geometric characteristics of each letter and computes the mean value and variance of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36fdf541da4cfc49ecdba16e755e1504
https://doi.org/10.1111/j.1475-4754.2007.00333.x
https://doi.org/10.1111/j.1475-4754.2007.00333.x
Autor:
Arika Indah Kristiana, M. Hidayat, Robiatul Adawiyah, D. Dafik, Susi Setiawani, Ridho Alfarisi
Publikováno v:
Ural Mathematical Journal, Vol 8, Iss 2 (2022)
Let \(G=(V,E)\) be a graph with a vertex set \(V\) and an edge set \(E\). The graph \(G\) is said to be with a local irregular vertex coloring if there is a function \(f\) called a local irregularity vertex coloring with the properties: (i) \(l:(V(G)
Externí odkaz:
https://doaj.org/article/bb674d9a115c4b97a9838c9a330634f8
Publikováno v:
IEEE transactions on pattern analysis and machine intelligence. 31(8)
This paper introduces a novel methodology for the classification of ancient Greek inscriptions according to the writer who carved them. Inscription writer identification is crucial for dating the written content, which in turn is of fundamental impor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58910d7eab12f667e3026e25b3233a82
https://pubmed.ncbi.nlm.nih.gov/19542575
https://pubmed.ncbi.nlm.nih.gov/19542575
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 1, Pp 14-23 (2019)
This paper is aimed to study the use of super (a, d)-H antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of su
Externí odkaz:
https://doaj.org/article/b4e01c71b530475fb73f76fd63fe3b43
Publikováno v:
Indonesian Journal of Combinatorics, Vol 1, Iss 1, Pp 22-30 (2016)
Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices receive different colors. An $r$
Externí odkaz:
https://doaj.org/article/cd6d66d6ca5f484585965ae1346e892d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.