Now showing items 1-18 of 18

    • Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes 

      Fariña, Antonio; Gagie, Travis; Manzini, Giovanni; Navarro, Gonzalo; Ordóñez, Alberto (Springer, 2016-09-21)
      [Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
    • GraCT: A Grammar Based Compressed Representation of Trajectories 

      Brisaboa, Nieves R.; Gómez-Brandón, Adrián; Navarro, Gonzalo; Paramá, José R. (Springer, 2016-09-21)
      [Abstract] We present a compressed data structure to store free trajectories of moving objects (ships over the sea, for example) allowing spatio-temporal queries. Our method, GraCT, uses a k2k2 -tree to store the absolute ...
    • Compact Trip Representation over Networks 

      Brisaboa, Nieves R.; Fariña, Antonio; Galaktionov, Daniil; Rodríguez, M. Andrea (Springer, 2016-09-21)
      [Abstract] We present a new Compact Trip Representation ( CTRCTR ) that allows us to manage users’ trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where ...
    • Efficient Representation of Multidimensional Data over Hierarchical Domains 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; López López, Narciso; Navarro, Gonzalo; Penabad, Miguel R.; Silva-Coira, Fernando (Springer, 2016-09-21)
      [Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ...
    • A New Method to Index and Store Spatio-Temporal Data 

      Bernardo, Guillermo de; Casares, Ramón; Gómez-Brandón, Adrián; Paramá, José R. (2016-11-16)
      [Abstract] We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, ...
    • Navigational Rule Derivation: An algorithm to determine the effect of traffic signs on road networks 

      Galaktionov, Daniil; Rodríguez Luaces, Miguel; Saavedra Places, Ángeles (2016-11-17)
      [Abstract] In this paper we present an algorithm to build a road network map enriched with traffic rules such as one-way streets and forbidden turns, based on the interpretation of already detected and classified traffic ...
    • 3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories 

      Brisaboa, Nieves R.; Gómez-Brandón, Adrián; Martínez-Prieto, Miguel A.; Paramá, José R. (Springer, 2018)
      [Abstract]: Much research has been published about trajectory management on the ground or at the sea, but compression or indexing of flight trajectories have usually been less explored. However, air traffic management is ...
    • Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication 

      Francisco, Alexandre P.; Gagie, Travis; Ladra, Susana; Navarro, Gonzalo (IEEE Computer Society, 2018-03)
      [Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...
    • Towards a Compact Representation of Temporal Rasters 

      Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio; Paramá, José R.; Silva-Coira, Fernando (Springer Nature, 2018-09)
      [Abstract]: Big research efforts have been devoted to efficiently manage spatio-temporal data. However, most works focused on vectorial data, and much less, on raster data. This work presents a new representation for raster ...
    • Design of Mutation Operators for Testing Geographic Information Systems 

      Alvarado, Suilen H. (M D P I AG, 2019-08-06)
      [Abstract] In this article, we propose the definition of specific mutation operators for testing Geographic Information Systems. We describe the process for applying the operators and generating mutants, and present a case ...
    • Improved Compressed String Dictionaries 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Navarro, Gonzalo (ACM, 2019-11-03)
      [Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ...
    • Revisiting Compact RDF Stores Based on k2-Trees 

      Brisaboa, Nieves R.; Cerdeira-Pena, Ana; Bernardo, Guillermo de; Fariña, Antonio (IEEE Xplore, 2020-03)
      [Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary ...
    • Towards a Non-Functional Requirements Discovery Approach for Persuasive Systems 

      Condori Fernández, Nelly; Araujo, Joao; Catalá, Alejandro; Lago, Patricia (Association for Computing Machinery, 2020-03-30)
      [Abstract] A number of software systems that attempt to help people achieve behavior change have been proposed in various domains such as health and wellness. However, sometimes, such systems have failed to provide a ...
    • An Efficient Representation of Enriched Temporal Trajectories 

      Brisaboa, Nieves R.; Fariña, Antonio; Otero-González, Diego; Varela Rodeiro, Tirso (SciTePress, 2021)
      [Abstract] We present a novel representation of enriched trajectories of a mobile workforce management system. In this system, employees are tracked during their working day and both their routes and the tasks performed ...
    • Succinct Data Structures in the Realm of GIS 

      Brisaboa, Nieves R.; Gutiérrez-Asorey, Pablo; Rodríguez Luaces, Miguel; Varela Rodeiro, Tirso (MDPI, 2021)
      [Abstract] Geographic Information Systems (GIS) have spread all over our technological environment in the last decade. The inclusion of GPS technologies in everyday portable devices along with the creation of massive ...
    • Tool for SPARQL Querying over Compact RDF Representations 

      Ramos-Vidal, Delfina; Bernardo, Guillermo de (MDPI, 2021)
      [Abstract] We present an architecture for the efficient storing and querying of large RDF datasets. Our approach seeks to store RDF datasets in very little space while offering complete SPARQL functionality. To achieve ...
    • Towards a Semi-Automated Data-Driven Requirements Prioritization Approach for Reducing Stakeholder Participation in SPL Development 

      Limaylla-Lunarejo, María-Isabel; Condori Fernández, Nelly; Rodríguez Luaces, Miguel (MDPI, 2021)
      [Abstract] Requirements prioritization (RP), part of Requirements engineering (RE), is an essential activity of Software Product-Lines (SPL) paradigm. Similar to standard systems, the identification and prioritization of ...
    • Augmented Thresholds for MONI 

      Martínez-Guardiola, César; Brown, Nathaniel K.; Silva-Coira, Fernando; Köppl, Dominik; Gagie, Travis; Ladra, Susana (Institute of Electrical and Electronics Engineers Inc., 2023)
      [Abstract]: MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. In this paper we consider its one-pass ...