default search action
Pedro Ribeiro 0004
Person information
- affiliation: University of Porto, Computer Science Department, Portugal
Other persons with the same name
- Pedro Ribeiro — disambiguation page
- Pedro Ribeiro 0001
— University of Minho, Centro ALGORITMI, Guimarães, Portugal
- Pedro Ribeiro 0002
- Pedro Ribeiro 0003
- Pedro Ribeiro 0005
- Pedro Ribeiro 0006
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Ahmad Naser Eddin, Jacopo Bono, David Aparício, Hugo Ferreira, Pedro Ribeiro, Pedro Bizarro:
Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs. CoRR abs/2407.07712 (2024) - 2023
- [c33]Ricardo Ribeiro Pereira, Jacopo Bono, João Tiago Ascensão, David Aparício, Pedro Ribeiro, Pedro Bizarro:
The GANfather: Controllable generation of malicious activity to improve defence systems. ICAIF 2023: 133-140 - [c32]Jacopo Bono, Ahmad Naser Eddin, David Aparício, Hugo Ferreira, João Tiago Ascensão, Pedro Ribeiro, Pedro Bizarro:
From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs. ICAIF 2023: 176-184 - [i11]Vanessa Freitas Silva, Maria Eduarda Silva, Pedro Ribeiro, Fernando M. A. Silva:
MHVG2MTS: Multilayer Horizontal Visibility Graphs for Multivariate Time Series Analysis. CoRR abs/2301.02333 (2023) - [i10]Ahmad Naser Eddin, Jacopo Bono, David Aparício, Hugo Ferreira, João Tiago Ascensão, Pedro Ribeiro, Pedro Bizarro:
From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs. CoRR abs/2307.08433 (2023) - [i9]Ricardo Ribeiro Pereira, Jacopo Bono, João Tiago Ascensão, David Aparício, Pedro Ribeiro, Pedro Bizarro:
The GANfather: Controllable generation of malicious activity to improve defence systems. CoRR abs/2307.13787 (2023) - [i8]Vanessa Freitas Silva, Maria Eduarda Silva, Pedro Ribeiro, Fernando M. A. Silva:
Multilayer Quantile Graph for Multivariate Time Series Analysis and Dimensionality Reduction. CoRR abs/2311.11849 (2023) - 2022
- [j12]Pedro Ribeiro
A Survey on Subgraph Counting: Concepts, Algorithms, and Applications to Network Motifs and Graphlets. ACM Comput. Surv. 54(2): 28:1-28:36 (2022) - [j11]Vanessa Freitas Silva
Novel features for time series analysis: a complex networks approach. Data Min. Knowl. Discov. 36(3): 1062-1101 (2022) - [c31]José Ferreira, Alberto Barbosa, Pedro Ribeiro
Towards the Concept of Spatial Network Motifs. COMPLEX NETWORKS (2) 2022: 565-577 - [c30]Alberto Barbosa, Pedro Ribeiro
Improving the Characterization and Comparison of Football Players with Spatial Flow Motifs. COMPLEX NETWORKS (2) 2022: 579-591 - [e1]Pedro Ribeiro
Network Science - 7th International Winter Conference, NetSci-X 2022, Porto, Portugal, February 8-11, 2022, Proceedings. Lecture Notes in Computer Science 13197, Springer 2022, ISBN 978-3-030-97239-4 [contents] - 2021
- [j10]Vanessa Freitas Silva
Time series analysis via network science: Concepts and algorithms. WIREs Data Mining Knowl. Discov. 11(3) (2021) - [c29]Alberto Barbosa, Pedro Ribeiro
Similarity of Football Players Using Passing Sequences. MLSA@PKDD/ECML 2021: 51-61 - [i7]Vanessa Freitas Silva, Maria Eduarda Silva, Pedro Ribeiro, Fernando M. A. Silva:
Time Series Analysis via Network Science: Concepts and Algorithms. CoRR abs/2110.09887 (2021) - [i6]Vanessa Freitas Silva, Maria Eduarda Silva, Pedro Ribeiro, Fernando M. A. Silva:
Novel Features for Time Series Analysis: A Complex Networks Approach. CoRR abs/2110.09888 (2021) - [i5]Ahmad Naser Eddin, Jacopo Bono, David Aparício, David Polido, João Tiago Ascensão, Pedro Bizarro, Pedro Ribeiro:
Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs. CoRR abs/2112.07508 (2021) - 2020
- [j9]Luís Q. Alves, Raquel Ruivo
PseudoChecker: an integrated online platform for gene inactivation inference. Nucleic Acids Res. 48(Webserver-Issue): W321-W331 (2020) - [c28]Henrique Branquinho
StreamFaSE: An Online Algorithm for Subgraph Counting in Dynamic Networks. COMPLEX NETWORKS (2) 2020: 688-699 - [c27]Jorge M. B. Silva, David Aparício
FOCAS: penalising friendly citations to improve author ranking. SAC 2020: 1852-1860
2010 – 2019
- 2019
- [j8]David Oliveira Aparício
Temporal network alignment via GoT-WAVE. Bioinform. 35(18): 3527-3529 (2019) - [j7]Miguel Araujo
TensorCast: forecasting and mining with coupled tensors. Knowl. Inf. Syst. 59(3): 497-522 (2019) - [c26]David Aparício
Finding Dominant Nodes Using Graphlets. COMPLEX NETWORKS (1) 2019: 77-89 - [i4]Pedro Ribeiro
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. CoRR abs/1910.13011 (2019) - 2018
- [c25]Jorge M. B. Silva
Hierarchical Expert Profiling Using Heterogeneous Information Networks. DS 2018: 344-360 - [c24]Miguel Araujo, Pedro Manuel Pinto Ribeiro
TensorCast: Forecasting Time-Evolving Networks with Contextual Information. IJCAI 2018: 5199-5203 - [r2]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva:
Querying Volatile and Dynamic Networks. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018 - [i3]David Oliveira Aparício
GoT-WAVE: Temporal network alignment using graphlet-orbit transitions. CoRR abs/1808.08195 (2018) - 2017
- [j6]David Oliveira Aparício
Extending the Applicability of Graphlets to Directed Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 14(6): 1302-1315 (2017) - [c23]Miguel Ramos de Araujo
TensorCast: Forecasting with Context Using Coupled Tensors (Best Paper Award). ICDM 2017: 71-80 - [c22]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Evolutionary role mining in complex networks by ensemble clustering. SAC 2017: 1053-1060 - [c21]Ahmad Naser Eddin, Pedro Manuel Pinto Ribeiro
Scalable subgraph counting using MapReduce. SAC 2017: 1574-1581 - [i2]David Oliveira Aparício
Temporal Network Comparison using Graphlet-orbit Transitions. CoRR abs/1707.04572 (2017) - 2016
- [c20]David Oliveira Aparício
A Subgraph-Based Ranking System for Professional Tennis Players. CompleNet 2016: 159-171 - [c19]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Large Scale Graph Representations for Subgraph Census. NetSci-X 2016: 186-194 - [c18]Miguel Araujo
FastStep: Scalable Boolean Matrix Decomposition. PAKDD (1) 2016: 461-473 - 2015
- [j5]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Dynamic inference of social roles in information cascades. Data Min. Knowl. Discov. 29(5): 1152-1177 (2015) - [j4]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Rand-FaSE: fast approximate subgraph census. Soc. Netw. Anal. Min. 5(1): 17:1-17:18 (2015) - [c17]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Pairwise structural role mining for user categorization in information cascades. ASONAM 2015: 137-144 - [c16]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Discovering weighted motifs in gene co-expression networks. SAC 2015: 10-17 - [i1]David Oliveira Aparício
Network comparison using directed graphlets. CoRR abs/1511.01964 (2015) - 2014
- [j3]Pedro Manuel Pinto Ribeiro
G-Tries: a data structure for storing and finding subgraphs. Data Min. Knowl. Discov. 28(2): 337-377 (2014) - [c15]Pedro Manuel Pinto Ribeiro
Discovering Colored Network Motifs. CompleNet 2014: 107-118 - [c14]David Oliveira Aparício
A Scalable Parallel Approach for Subgraph Census Computation. Euro-Par Workshops (2) 2014: 194-205 - [c13]David Oliveira Aparício
Parallel Subgraph Counting for Multicore Architectures. ISPA 2014: 34-41 - [r1]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Querying Volatile and Dynamic Networks. Encyclopedia of Social Network Analysis and Mining 2014: 1456-1463 - 2013
- [c12]Pedro Paredes, Pedro Manuel Pinto Ribeiro
Towards a faster network-centric subgraph census. ASONAM 2013: 264-271 - 2012
- [j2]Pedro Manuel Pinto Ribeiro
Parallel discovery of network motifs. J. Parallel Distributed Comput. 72(2): 144-154 (2012) - [c11]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Comparison of co-authorship networks across scientific fields using motifs. ASONAM 2012: 147-152 - [c10]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Event detection in evolving networks. CASoN 2012: 26-32 - [c9]Pedro Manuel Pinto Ribeiro
Querying subgraph sets with g-tries. DBSocial 2012: 25-30 - [c8]Sarvenaz Choobdar, Pedro Manuel Pinto Ribeiro
Motif Mining in Weighted Networks. ICDM Workshops 2012: 210-217 - 2011
- [c7]Sarvenaz Choobdar, Fernando M. A. Silva
Network Node Label Acquisition and Tracking. EPIA 2011: 418-430 - 2010
- [c6]Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva, Luís M. B. Lopes:
Parallel Calculation of Subgraph Census in Biological Networks. BIOINFORMATICS 2010: 56-65 - [c5]Pedro Ribeiro
A Parallel Algorithm for Counting Subgraphs in Complex Networks. BIOSTEC (Selected Papers) 2010: 380-393 - [c4]Pedro Manuel Pinto Ribeiro
Efficient Parallel Subgraph Counting Using G-Tries. CLUSTER 2010: 217-226 - [c3]Pedro Manuel Pinto Ribeiro
g-tries: an efficient data structure for discovering network motifs. SAC 2010: 1559-1566 - [c2]Pedro Manuel Pinto Ribeiro
Efficient Subgraph Frequency Estimation with G-Tries. WABI 2010: 238-249
2000 – 2009
- 2009
- [j1]Pedro Manuel Pinto Ribeiro, Hugo Simões, Michel Ferreira:
Teaching Artificial Intelligence and Logic Programming in a Competitive Environment. Informatics Educ. 8(1): 85-100 (2009) - [c1]Pedro Manuel Pinto Ribeiro
Strategies for Network Motifs Discovery. eScience 2009: 80-87
Coauthor Index
aka: David Aparício
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: