Now showing items 1-7 of 7

  • High quality, scalable and parallel community detection for large real graphs 

    Prat Pérez, Arnau; Domínguez Sal, David; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2014)
    Conference report
    Restricted access - publisher's policy
    Community detection has arisen as one of the most relevant topics in the field of graph mining, principally for its applications in domains such as social or biological networks analysis. Different community detection ...
  • Marshall-Olkin extended Zipf distribution 

    Pérez Casany, Marta; Duarte López, Ariel; Prat Pérez, Arnau (Springer, 2015-12-18)
    Part of book or chapter of book
    Open Access
    Being able to generate large synthetic graphs resembling those found in the real world, is of high importance for the design of new graph algorithms and benchmarks. In this paper, we first compare several probability models ...
  • Producer-consumer: the programming model for future many-core processors 

    Prat Pérez, Arnau; Domínguez Sal, David; Larriba Pey, Josep; Troncoso, Pedro (Springer, 2013)
    Conference report
    Restricted access - publisher's policy
    The massive addition of cores on a chip is adding more pressure to the accesses to main memory. In order to avoid this bottleneck, we propose the use of a simple producer-consumer model, which allows for the temporary ...
  • Put three and three together: Triangle-driven community detection 

    Prat Pérez, Arnau; Domínguez Sal, David; Brunat Blay, Josep Maria; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2016-02-01)
    Article
    Open Access
    Community detection has arisen as one of the most relevant topics in the field of graph data mining due to its applications in many fields such as biology, social networks, or network traffic analysis. Although the existing ...
  • Scalable community detection for social networks 

    Prat Pérez, Arnau (Universitat Politècnica de Catalunya, 2016-03-03)
    Doctoral thesis
    Open Access
    Many applications can be modeled intuitively as graphs, where nodes represent the entities and the edges the relationships between them. This way, we are able to better understand them and how they interact. One particularity ...
  • Social based layouts for the increase of locality in graph operations 

    Prat Pérez, Arnau; Domínguez Sal, David; Larriba Pey, Josep (2011)
    Article
    Restricted access - publisher's policy
    Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph ...
  • Using the Marshall-Olkin extended Zipf distribution in graph generation 

    Duarte López, Ariel; Prat Pérez, Arnau; Pérez Casany, Marta (Springer, 2015-12-18)
    Part of book or chapter of book
    Restricted access - publisher's policy
    Being able to generate large synthetic graphs resembling those found in the real world, is of high importance for the design of new graph algorithms and benchmarks. In this paper, we first compare several probability models ...