Listar GI-LBD - Congresos, conferencias, etc. por título
Mostrando ítems 20-26 de 26
-
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 ...