Zobrazeno 1 - 10
of 14
pro vyhledávání: '"M P Bekakos"'
Autor:
S G Fountoukis, M P Bekakos
Publikováno v:
Data Science Journal, Vol 6, Pp 121-136 (2007)
Herein, an extension to the object query language (OQL) for incorporating binary relational expressions is investigated. The extended query language is suitable for query submissions to an object oriented database, whose functionality is based upon t
Externí odkaz:
https://doaj.org/article/7e48e8dad3a64803b3e362176cdd7da8
Autor:
E. M. Karanikolaou, M. P. Bekakos
Publikováno v:
WSEAS TRANSACTIONS ON COMPUTERS. 21:23-30
The need for new and more reliable metrics is always in demand. In this paper, a new metric is proposed for the evaluation of high performance computing platforms in conjunction with their energy consumption. The aim of the new metric is to reliably
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::757bff4cca8c2292c6cef2cd2c606e1b
https://doi.org/10.37394/23205.2022.21.4
https://doi.org/10.37394/23205.2022.21.4
Publikováno v:
Creative Mathematics and Informatics. 25:71-75
Let G = (V, E) be an undirected simple graph of order n with m edges without isolated vertices. Further, let d1 ≥ d2 ≥ · · · ≥ dn be vertex degree sequence of G. General Randic index of graph ´ G = (V, E) is defined by Rα = X (i,j)∈E (di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33d7a86da3e903b7320135bcd38ae511
https://doi.org/10.37193/cmi.2016.01.09
https://doi.org/10.37193/cmi.2016.01.09
Publikováno v:
Filomat. 23:1-12
In this paper a bidirectional linear systolic array (BLSA) that computes minimum cost spanning tree (MCST) of a given graph is designed. We present a synthesis procedure, based on data dependencies and space-time transformations of index space, to de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::952efaf3e21909d1ed5330f07dd3c9d3
https://doi.org/10.2298/fil0901001m
https://doi.org/10.2298/fil0901001m
Autor:
David J. Evans, M. P. Bekakos
Publikováno v:
International Journal of Computer Mathematics. 46:113-130
The explicit methods although very suitable for parallel processing always deny us reasonable accuracy and some stability; on the other hand, the implicit schemes offer stability, but the exploitation of these methods for parallel processing may be d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::187501b3a7cd81cd5785f9afa29d26ba
https://doi.org/10.1080/00207169208804143
https://doi.org/10.1080/00207169208804143
Autor:
M. P. Bekakos, David J. Evans
Publikováno v:
International Journal of Computer Mathematics. 46:163-181
In this paper the authors apply the rotate and fold (R & F) concept in the LU-factorization strategy on a hexagonal systolic array of processors to a quindiagonal system of linear equations.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e18bb199b34c0960b58725e2d5aff41b
https://doi.org/10.1080/00207169208804148
https://doi.org/10.1080/00207169208804148
Publikováno v:
AIP Conference Proceedings.
In this paper, parallelism methodologies for the mapping of machine learning algorithms derived rules on both software and hardware are investigated. Feeding the input of these algorithms with patient diseases data, medical diagnostic decision trees
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::526950aa0315f440f60b923e82992895
https://doi.org/10.1063/1.3225475
https://doi.org/10.1063/1.3225475
Publikováno v:
AIP Conference Proceedings.
Herein, a processing net consisting of a set of interconnected high performance array processor nodes, which composes object binary relations along all the possible net directions, is investigated. Object binary relation compositions are required for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f930dfc289ba3b63fe01748b43e1e83
https://doi.org/10.1063/1.3225469
https://doi.org/10.1063/1.3225469
Autor:
O. B. Efremides, M. P. Bekakos
Publikováno v:
Journal of Mathematical Modelling & Algorithms; Jul2002, Vol. 1 Issue 3, p215-223, 9p