Zobrazeno 1 - 10
of 376
pro vyhledávání: '"Alex Thomo"'
Publikováno v:
Distributed and Parallel Databases. 40:335-372
Publikováno v:
Distributed and Parallel Databases. 40:299-333
Truss decomposition is a popular notion of hierarchical dense substructures in graphs. In a nutshell
Publikováno v:
Future Internet, Vol 7, Iss 2, Pp 110-139 (2015)
Quality web service discovery requires narrowing the search space from an overwhelming set of services down to the most relevant ones, while matching the consumer’s request. Today, the ranking of services only considers static attributes or snapsho
Externí odkaz:
https://doaj.org/article/9bbf4a7e80904f87a002f20b60a75ca1
Publikováno v:
2022 IEEE International Conference on Big Data (Big Data).
Autor:
Li Xing, Alex Thomo, Fatemeh Esfahani, Venkatesh Srinivasan, Xiaojian Shao, Yang Guo, Xuekui Zhang
Publikováno v:
Briefings in Bioinformatics
The severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) is responsible for millions of deaths around the world. To help contribute to the understanding of crucial knowledge and to further generate new hypotheses relevant to SARS-CoV-2 and hu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e6493af6691e448ce6bf9eab0689125
https://nrc-publications.canada.ca/eng/view/object/?id=c8ad0ee9-d76b-41bc-a519-bfd08da42ae2
https://nrc-publications.canada.ca/eng/view/object/?id=c8ad0ee9-d76b-41bc-a519-bfd08da42ae2
Publikováno v:
2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).
Publikováno v:
2022 13th International Conference on Information, Intelligence, Systems & Applications (IISA).
Publikováno v:
The Computer Journal.
We consider misinformation propagating through a social network and study the problem of its prevention. The goal is to identify a set of $k$ users that need to be convinced to adopt a limiting campaign so as to minimize the number of people that end
Publikováno v:
Proceedings of the VLDB Endowment. 13:2787-2800
We investigate the problem of building a suffix array substring index for inputs significantly larger than main memory. This problem is especially important in the context of biological sequence analysis, where biological polymers can be thought of a
Publikováno v:
The Computer Journal. 64:1343-1357
Algorithmic problem of computing the most influential nodes in an arbitrary graph (influence maximization) is an important theoretical and practical problem and has been extensively studied for decades. For massive graphs (e.g. modelling huge social