Recent Submissions

  • Automatic multi-partite graph generation from arbitrary data 

    Álvarez García, Sandra; Baeza Yates, Ricardo; Brisaboa, Nieves R.; Larriba Pey, Josep; Pedreira, Oscar (2014-08-22)
    Article
    Restricted access - publisher's policy
    In this paper we present a generic model for automatic generation of basic multi-partite graphs obtained from collections of arbitrary input data following user indications. The paper also presents GraphGen, a tool that ...
  • Two-way replacement selection 

    Martínez Palau, Xavier; Domínguez Sal, David; Larriba Pey, Josep (Association for Computing Machinery (ACM), 2010-09-01)
    Article
    Restricted access - publisher's policy
    The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacement Selection (RS) because, on average, it ...
  • Using genetic algorithms for attribute grouping in multivariate microaggregation 

    Balasch Masoliver, Jordi; Muntés Mulero, Víctor; Nin Guerrero, Jordi (2014-01-01)
    Article
    Open Access
    Anonymization techniques that provide k-anonymity suffer from loss of quality when data dimensionality is high. Microaggregation techniques are not an exception. Given a set of records, attributes are grouped into ...
  • A discussion on the design of graph database benchmarks 

    Domínguez Sal, David; Martínez Bazán, Norbert; Muntés Mulero, Víctor; Baleta Ferrer, Pedro; Larriba Pey, Josep (2011)
    Article
    Open Access
    Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interrelated data. The objective of this paper ...
  • Generalized median string computation by means of string embedding in vector spaces 

    Jiang, Xiaoyi; Wentker, Jöran; Ferrer Sumsi, Miquel (2012-11-01)
    Article
    Restricted access - publisher's policy
    In structural pattern recognition the median string has been established as a useful tool to represent a set of strings. However, its exact computation is complex and of high computational burden. In this paper we propose ...
  • Using Evolutive Summary Counters for Efficient Cooperative Caching in Search Engines 

    Domínguez Sal, David; Aguilar Saborit, Josep; Surdeanu, Mihai; Larriba Pey, Josep (2012-04)
    Article
    Open Access
  • 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 ...
  • Cooperative cache analysis for distributed search engines 

    Domínguez Sal, David; Pérez Casany, Marta; Larriba Pey, Josep (2010)
    Article
    Restricted access - publisher's policy
    In this paper, we study the performance of a distributed search engine from a data caching point of view using statistical tools on a varied set of configurations. We study two strategies to achieve better performance: ...

View more