Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Johan Kok"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 1, Pp 48-62 (2019)
For a colour cluster C = (C1, C2, C3, …, Cℓ), where Ci is a colour class such that ∣Ci∣ = ri, a positive integer, we investigate two types of simple connected graph structures G1C, G2C which represent graphical embodiments of the colour clust
Externí odkaz:
https://doaj.org/article/578be54b1ae24896a028864cc7f9b5e5
Agreement between Computerized and Human Assessment of Performance on the Ruff Figural Fluency Test.
Autor:
Martin F Elderson, Sander Pham, Marlise E A van Eersel, LifeLines Cohort Study, Bruce H R Wolffenbuttel, Johan Kok, Ron T Gansevoort, Oliver Tucha, Melanie M van der Klauw, Joris P J Slaets, Gerbrand J Izaks
Publikováno v:
PLoS ONE, Vol 11, Iss 9, p e0163286 (2016)
The Ruff Figural Fluency Test (RFFT) is a sensitive test for nonverbal fluency suitable for all age groups. However, assessment of performance on the RFFT is time-consuming and may be affected by interrater differences. Therefore, we developed comput
Externí odkaz:
https://doaj.org/article/b36313bc6e5641ab8bb0c55f1da6654e
Real-time fraud detection is a challenge for most financial and electronic commercial platforms. To identify fraudulent communities, Grab, one of the largest technology companies in Southeast Asia, forms a graph from a set of transactions and detects
Externí odkaz:
http://arxiv.org/abs/2211.06977
The use of deep learning models for forecasting the resource consumption patterns of SQL queries have recently been a popular area of study. With many companies using cloud platforms to power their data lakes for large scale analytic demands, these m
Externí odkaz:
http://arxiv.org/abs/2103.12465
Autor:
JOHAN KOK, JOSEPH SHINY
Publikováno v:
Математички билтен/BULLETIN MATHÉMATIQUE DE LA SOCIÉTÉ DES MATHÉMATICIENS DE LA RÉPUBLIQUE MACÉDOINE. 46:43-49
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ffbe1cace6fef626ed9d4d00a6a6fa0
https://doi.org/10.37560/matbil22461043k
https://doi.org/10.37560/matbil22461043k
Autor:
Johan Kok
Publikováno v:
Malaya Journal of Matematik. 10:343-353
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a036004e9ad2fc90c3dfa5a6a56173d6
https://doi.org/10.26637/mjm1004/005
https://doi.org/10.26637/mjm1004/005
Autor:
Johan Kok
Publikováno v:
Acta Universitatis Sapientiae, Informatica. 13:324-334
This paper presents results for some vertex stress related parameters in respect of specific subfamilies of Kneser graphs. Kneser graphs for which diam(KG(n, k)) = 2 and k ≥ 2 are considered. The note establishes the foundation for researching simi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c60b26862148b9af7deb9e6803de155f
https://doi.org/10.2478/ausi-2021-0015
https://doi.org/10.2478/ausi-2021-0015
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
The eccentric graph of a graph [Formula: see text], denoted by [Formula: see text], is a derived graph with the vertex set same as that of [Formula: see text] and two vertices in [Formula: see text] are adjacent if one of them is an eccentric vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e36538f217c66d4e79cf114adfa6eb5d
https://doi.org/10.1142/s1793830922501555
https://doi.org/10.1142/s1793830922501555
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.
Publikováno v:
Journal of the Indonesian Mathematical Society. :150-157
This paper introduces new parameters called induced vertex stress and total induced vertex stress in G, respectively. For graphs G and H, aspects of the maximum and minimum total induced vertex stress that can be obtained by 1-edge addition and 2-ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::492e393d445b6f5b6506c05441183241
https://doi.org/10.22342/jims.27.2.966.150-157
https://doi.org/10.22342/jims.27.2.966.150-157