Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Mostafa Nouri Baygi"'
Autor:
hosein salami, Mostafa Nouri Baygi
Publikováno v:
Computer and Knowledge Engineering, Vol 6, Iss 1, Pp 27-35 (2023)
In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be p
Externí odkaz:
https://doaj.org/article/42b57e390b3c455eae02da035efb2ca6
Autor:
Maryam Adineh, Mostafa Nouri Baygi
Publikováno v:
Computer and Knowledge Engineering, Vol 5, Iss 1, Pp 37-46 (2022)
The problem of influence maximization is selecting the most influential individuals in a social network. With the popularity of social network sites and the development of viral marketing, the importance of the problem has increased. The influence ma
Externí odkaz:
https://doaj.org/article/8a48f005a3994c56a82b2951ecc10790
Publikováno v:
The Journal of Supercomputing. 78:16975-16996
Publikováno v:
Biosystems. 226:104869
Autor:
Mostafa Nouri-Baygi, Ghasem Sadeghi Bajestani, Ali Mollaei, Adel Ghazi Khani, Mahboobe Behrooz
Publikováno v:
Computer Methods and Programs in Biomedicine. 177:277-283
Background and objectives Autism spectrum disorder (ASD) is a disorder in the information flow of the human brain system that can lead to secondary problems for the patient. Only when ASD is diagnosed by clinical methods can the secondary problems be
Publikováno v:
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE).
Minisatellites are genomic sequences comprised of short monomers which are successively repeated many times in the same direction. They are highly variable sequences in terms of their monomer building blocks, number of repeats, and their location on
Autor:
Mostafa Nouri-Baygi, Ashkan Rezazadeh
Publikováno v:
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE).
We consider 1-local online routing on a special class of geometric graphs called Delaunay triangulations (DTs). A geometric graph G = (V, E) of a point set consists of a set of points in the plane and edges between them, where each edge weighs as the
There are many challenges involved in building near-term large-scale quantum computers. Some of these challenges can be overcome by partitioning a quantum circuit into smaller parts and allowing each part to be executed on a smaller quantum unit. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e9752ef90a0ce4320af78e9ff6da0bd
http://arxiv.org/abs/2005.01052
http://arxiv.org/abs/2005.01052
Autor:
Mostafa Nouri Baygi
Publikováno v:
International Journal of Foundations of Computer Science. 29:1231-1245
In the past decades, there has been a burst of activity to simplify implementation of complex software systems. The solution framework in software engineering community for this problem is called component-based software design (CBSD), whereas in the
Autor:
Mostafa Nouri-Baygi, Maryam Adineh
Publikováno v:
2018 8th International Conference on Computer and Knowledge Engineering (ICCKE).
Influence maximization is the problem of selecting a subset of individuals in a social network that maximizes the influence propagated in the network. With the popularity of social network sites, and the development of viral marketing, the importance