Detalhes
Nome
Miguel Pinto SilvaCluster
InformáticaCargo
InvestigadorDesde
10 julho 2015
Nacionalidade
PortugalCentro
Laboratório de Inteligência Artificial e Apoio à DecisãoContactos
+351220402963
miguel.p.silva@inesctec.pt
2022
Autores
Marshall, GC; Skeva, R; Jay, C; Silva, MEP; Fyles, M; House, T; Davis, EL; Pi, L; Medley, GF; Quilty, BJ; Dyson, L; Yardley, L; Fearon, E;
Publicação
F1000Research
Abstract
2021
Autores
Ribeiro, P; Paredes, P; Silva, MEP; Aparicio, D; Silva, F;
Publicação
ACM COMPUTING SURVEYS
Abstract
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from multiple domains. Counting subgraphs is, however, computationally very expensive, and there has been a large body of work on efficient algorithms and strategies to make subgraph counting feasible for larger subgraphs and networks. This survey aims precisely to provide a comprehensive overview of the existing methods for subgraph counting. Our main contribution is a general and structured review of existing algorithms, classifying them on a set of key characteristics, highlighting their main similarities and differences. We identify and describe the main conceptual approaches, giving insight on their advantages and limitations, and we provide pointers to existing implementations. We initially focus on exact sequential algorithms, but we also do a thorough survey on approximate methodologies (with a trade-off between accuracy and execution time) and parallel strategies (that need to deal with an unbalanced search space).
2021
Autores
Fearon, E; Buchan, IE; Das, R; Davis, EL; Fyles, M; Hall, I; Hollingsworth, TD; House, T; Jay, C; Medley, GF; Pellis, L; Quilty, BJ; Silva, MEP; Stage, HB; Wingfield, T;
Publicação
LANCET RESPIRATORY MEDICINE
Abstract
2017
Autores
Silva, MEP; Paredes, P; Ribeiro, P;
Publicação
Springer Proceedings in Complexity
Abstract
In order to detect network motifs we need to evaluate the exceptionality of subgraphs in a given network. This is usually done by comparing subgraph frequencies on both the original and an ensemble of random networks keeping certain structural properties. The classical null model implies preserving the degree sequence. In this paper our focus is on a richer model that approximately fixes the frequency of subgraphs of size K - 1 to compute motifs of size K. We propose a method for generating random graphs under this model, and we provide algorithms for its efficient computation. We show empirical results of our proposed methodology on neurobiological networks, showcasing its efficiency and its differences when comparing to the traditional null model. © Springer International Publishing AG 2017.
2017
Autores
Silva, M; Florido, M; Pfenning, F;
Publicação
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
Abstract
Concurrent C0 is an imperative programming language in the C family with session-typed messagepassing concurrency. The previously proposed semantics implements asynchronous (non-blocking) output; we extend it here with non-blocking input. A key idea is to postpone message reception as much as possible by interpreting receive commands as a request for a message. We implemented our ideas as a translation from a blocking intermediate language to a non-blocking language. Finally, we evaluated our techniques with several benchmark programs and show the results obtained. While the abstract measure of span always decreases (or remains unchanged), only a few of the examples reap a practical benefit.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.