Repositorio Dspace

Envíos recientes

DSpace del LBD/UDC: Envíos recientes

  • On the compression of search trees 
    Claude, Francisco; Seco, Diego; Nicholson, Patrick K. (Information Processing and Management, 2014)
    Let X = x1, x2, . . . , xn be a sequence of non-decreasing integer values. Stor- ing a compressed representation of X that supports access and search is a problem that occurs in many domains. The most common solution ...
  • Energy consumption in compact integer vectors: A study case 
    Fuentes-Sepúlveda, J.; Ladra, S. (IEEE Access, 2019)
    In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy consumption. Moreover, most of the efforts ...
  • Efficient Compression and Indexing of Trajectories 
    Rodríguez Brisaboa, Nieves; Gagie, Travis; Gómez Brandón, Adrián; Navarro, Gonzalo; R. Paramá, José (Springer, 2017)
    We present a new compressed representation of free trajec tories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical ...
  • Navigational Rule Derivation: An Algorithm To Determine The Effect Of Traffic Signs On Road Networks 
    Galaktionov, Daniil; Rodríguez Luaces, Miguel; Places, Ángeles (Proc. of the 20th Pacific Asia Conference on Information Systems, 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 signs. ...
  • Efficient set operations over k2-trees 
    Rodríguez Brisaboa, Nieves; De Bernardo, Guillermo; Gutiérrez, Gilberto; Ladra, Susana; Penabad, Miguel R.; A. Troncoso, Brunny (2015 Data Compression Conference, 2015)
    k2-trees have been proved successful to represent in a very compact way different kinds of binary relations, such as web graphs, RDFs or raster data. In order to be a fully functional succinct representation for these ...
  • Universal Indexes for Highly Repetitive Document Collections 
    Fariña, Antonio; Martínez-Prieto, Miguel Ángel; Navarro, Gonzalo; Claude, Francisco (Information Systems, 2016)
    Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These collections may reach huge sizes, but are formed mostly ...
  • New Discovery Methodologies in GIS: Improving the Information Retrieval Process 
    Rodríguez Brisaboa, Nieves; Rodríguez Luaces, Miguel; Seco, Diego (Discovery of Geospatial Resources, 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 access ...
  • Storing and Clustering Large Spatial Datasets Using Big Data Technologies 
    Cortiñas, Alejandro; Rodríguez Luaces, Miguel; Pereira, Óscar; Varela-Rodeiro, Tirso (Proc.16th Int. Symposium Web and Wireless Geographical Information Systems, 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 that ...
  • An Architecture for Software Engineering Gamification 
    Autor desconocido (2024)
  • Space-Efficient Representations of Raster Time Series 
    Autor desconocido (2011)
  • Proba - Aceptar/Rechazar 
    Gómez-Brandón, Adrián (2020)
  • Rank and select for succinct data structures 
    Fariña, Antonio; Ladra, Susana; Pedreira, Óscar; Saavedra Places, Ángeles (Elsevier, 2009)
    In this paper, we study different approaches for rank and select on sequences of bytes and propose new implementation strategies. Extensive experimental evaluation comparing the efficiency of the different alternatives are ...
  • String processing and information retrieval 
    R. Brisaboa, Nieves; Gagie, Travis; Gómez-Brandón, Adrián; Navarro, Gonzalo; R. Paramá, José (SPIRE, 2017)
    We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical ...
  • Compact and Eficient Representation of General Graph Databases 
    Álvarez-García, Sandra (Springer, 2019)
    In this paper, we propose a compact data structure to store labeled at- tributed graphs based on the k2-tree, which is a very compact data structure designed to represent a simple directed graph. The idea we propose can ...
  • Proba metadatos 
    Pérez, Pepe (2012)
  • Compresión de textos en Bases de Datos Digitales 
    Rodríguez Brisaboa, Nieves; Fariña, Antonio; Navarro, Gonzalo; Lorenzo Iglesias, Eva; Paramá Gabía, José Ramón; Esteller, María F. (AECI-CYTED, 2003)
    Este trabajo presenta una revisión de los métodos de compresión de textos, que permiten la búsqueda directa de palabras y frases dentro del texto sin necesidad de descomprimirlo. Se presentan las técnicas de compresión ...
  • The largest empty circle with location constraints in spatial databases 
    Gutiérrez, Gilberto; R. López, Juan; R. Paramá, José; R. Penabad, Miguel (Knowledge and Information Systems, 2018)
    Given a set S of points in the two-dimensional space, which are stored in a spatial database, this paper presents an e cient algorithm to nd the empty circle, in the area delimited by those points, with the largest ...
  • Self-Indexing RDF Archives 
    D. Fernández, Javier; Cerdeira-Pena, Ana; Martínez-Prieto, Miguel Ángel; Fariña, Antonio (Snowbird, 2016)
    Although Big RDF management is an emerging topic in the so-called Web of Data, existing techniques disregard the dynamic nature of RDF data. These RDF archives evolve over time and need to be preserved and queried across ...
  • Efficient Similarity Search by Combining Indexing and Caching Strategies 
    Rodríguez Brisaboa, Nieves; Cerdeira-Pena, Ana; Gil-Costa, Veronica; Marin, Mauricio; Pedreira, Oscar (SOFSEM, 2015)
    A critical issue in large scale search engines is to e ciently handle sudden peaks of incoming query tra c. 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, Daniil; Konow, Roberto; Ladra, Susana; Pedreira, Óscar (World Scientific, 2017)
    Author pro ling consists in determining some demographic attributes -such as gender, age, nationality, language, religion, and others- of an author for a given document. This task, which has applications in elds such ...