Repositorio Dspace

Envíos recientes

DSpace del LBD/UDC: Envíos recientes

  • Efficient Similarity Search by CombiningIndexing and Caching Strategies 
    Nieves R., Brisaboa (Database Lab., 2020)
    A critical issue in large scale search engines is to efficiently handle sudden peaks of incoming query traffic. Research in metric spaces has addressed this problem from the point of view of creating caches that provide ...
  • Competitive author profiling using compression-based strategies 
    Claude, Francisco; Galaktionov, Daniv; Konow, Roberto; Ladra, Susana; Pedreira, Óscar (2019)
    In this paper we address the problem by using several compression-inspired strategiesthat generate different models without analyzing or extracting specific features from thetextual content, making them style-oblivious ...
  • The largest empty circle with location constraints in spatial databases 
    Gilberto, Gutiérrez (Gilberto Gutiérrez et al., 2023)
    Given a set S of points in the two-dimensional space, which are stored in a spatial database, this paper presents an efficient algorithm to find the empty circle, in the area delimited by those points, with the largest ...
  • NAVIGATIONAL RULE DERIVATION: AN ALGORITHM TO DETERMINE THE EFFECT OF TRAFFIC SIGNS ON ROAD NETWORKS 
    Galaktionov, Daniil; R. Luaces, Miguel; S. Places, Ángeles (PACIS, 2016)
    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 ...
  • Compact and Efficient Representation of General Graph Databases1.0 
    Álvarez-García, Sandra; Freire, Borja; Ladra, Susana; Pedreira, Óscar (2019)
    In this paper, we propose a compact data structure to store labeled at-tributed graphs based on thek2-tree, which is a very compact data structure designedto represent a simple directed graph. The idea we propose ...
  • GraCT: A Grammar based Compressedrepresentation of Trajectories 
    Nieves R., Brisaboa; Gómez-Brandón, Adrián; Navarro, Gonzalo; R.Paramá, José (2019)
    We present a compressed data structure to store free tra-jectories of moving objects (ships over the sea, for example) allowingspatio-temporal queries. Our method, GraCT, uses ak2-tree to store theabsolute positions of all ...
  • Compressed and Queryable Self-Indexes for RDF Archives 
    de Bernardo, Guillermo (2021)
    RDF compression and querying are consolidated topics in the Web of Data, with a plethora of solutions to efficiently store and query static datasets. However, as RDF data changes along time, it becomes necessary to keep ...
  • New Discovery Methodologies in GIS: Improving the Information Retrieval Process 
    R. Brisaboa, Nieves; R. Luaces, Miguel; Seco, Diego (2012)
    In the last decade the availability of on-line resources, and also the number of users accessing those resources, have grown exponentially. The information retrieval process, which aims at the improvement of the ...
  • Storing and Clustering Large Spatial Datasets Using Big Data Technologies 
    Cortiñas, Alejandro; R. Luaces, Miguel; Varela-Rodeiro, Tirso (LNCS, 2018)
    In this paper we present the architecture of a system to store, query and visualize on the web large datasets of geographic information. The architecture includes a component to simulate a large number of drivers ...
  • Bitvectors with runs and the successor/predecessor problem 
    Gómez-Brandón, Adrián; R. Brisaboa, Nieves (IEEE Computer Society, 2020)
    The successor and predecessor problem consists of obtaining the closest value in a set of integers, greater/smaller than a given value. This problem has interesting applications, like the intersection of inverted lists. ...
  • Proba - Aceptar/Rechazar 
    Gómez-Brandón, Adrián (2020)
  • Proba 
    Gómez-Brandón, Adrián (2012)