Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Hamid Shahrivari"'
In complex networks, especially social networks, networks could be divided into disjoint partitions that the ratio between the number of internal edges (the edges between the vertices within same partition) to the number of outer edges (edges between
Externí odkaz:
http://arxiv.org/abs/1901.05359
Publikováno v:
2022 IEEE International Conference on Big Data (Big Data).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::443ea2723ba72dec13d8948b89317cf1
https://doi.org/10.1109/bigdata55660.2022.10020614
https://doi.org/10.1109/bigdata55660.2022.10020614
Publikováno v:
The Journal of Supercomputing. 75:8094-8114
In complex networks, especially social networks, networks could be divided into disjoint partitions. However, nodes could be partitioned such that the number of internal edges (the edges between the vertices within the same partition) to the number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0de3d30ccb48de140624b576aaad6df3
https://doi.org/10.1007/s11227-019-02978-4
https://doi.org/10.1007/s11227-019-02978-4
Publikováno v:
Proceedings of the 23rd International Conference on Extending Database Technology (EDBT)
Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a specified size such that the value of a user-defined scoring function over its enclosed points is maximized. A recently proposed top-k algorithm for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f359fae6ba3814c1a5daac82285a918b
https://zenodo.org/record/3744328
https://zenodo.org/record/3744328
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:
2017 International Conference on Computational Science and Computational Intelligence (CSCI).
Nowadays, identification and detection community structures in complex networks is an important factor in extracting useful information from networks. Label propagation algorithm with near linear-time complexity is one of the most popular methods for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d84e60185bd0b9254b1d25c99e6d391
https://doi.org/10.1109/csci.2017.150
https://doi.org/10.1109/csci.2017.150