Listar GI-LBD - Congresos, conferencias, etc. por título
Mostrando ítems 13-26 de 26
-
GraCT: A Grammar Based Compressed Representation of Trajectories
(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 ... -
Herramienta para la visualización de la movilidad durante la pandemia
(Sistedes, 2021)[Resumen]: En este artículo presentamos una herramienta prototipo desarrollada entre los meses de mayo a julio del 2020, durante la situación de pandemia por el COVID-19, para mostrar la información de movilidad proporcionada ... -
Improved Compressed String Dictionaries
(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 ... -
Navigational Rule Derivation: An algorithm to determine the effect of traffic signs on road networks
(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 ... -
Plugin for automatisation of phonetic-phonological analysis and obtaining analytical feedback for Spanish learners
(CEUR-WS.org, 2022)[Abstract] We present in this article the Plugin for phonetic-phonological analysis in Spanish (PAFe), which consists of a series of scripts (a code written with a programming language (Python) that, implement three ... -
Re-ingeniería y Modernización de la Biblioteca Virtual Galega
(Sistedes, 2021)[Resumen]: La Biblioteca Virtual Galega (BVG) es una biblioteca digital de referencia en literatura gallega de todos los tiempos, para el público general y especialmente para centros de educación de enseñanza obligatoria ... -
Revisiting Compact RDF Stores Based on k2-Trees
(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 ... -
Succinct Data Structures in the Realm of GIS
(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
(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 Compact Representation of Temporal Rasters
(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 ... -
Towards a Non-Functional Requirements Discovery Approach for Persuasive Systems
(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 ... -
Towards a Semi-Automated Data-Driven Requirements Prioritization Approach for Reducing Stakeholder Participation in SPL Development
(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 ... -
Utilización de estructuras compactas para la generalización cartográfica de información geográfica vectorial
(Sistedes, 2021)[Resumen]: A pesar de la madurez tecnológica de los Sistemas de Información Geográfica, todavía existen retos de investigación relevantes en el campo relacionados con las problemáticas del almacenamiento y representación ... -
Worst-Case-Optimal Similarity Joins on Graph Databases
(Association for Computing Machinery (ACM), 2024-03-06)[Absctract]: We extend the concept of worst-case optimal equijoins in graph databases to the case where some nodes are required to be within the k-nearest neighbors (kNN) of others under some similarity function. We model ...