Listar GI-LBD - Artigos por título
Mostrando ítems 35-49 de 49
-
New machine learning approaches for real-life human activity recognition using smartphone sensor-based data
(Elsevier B.V., 2023)[Abstract]: In recent years, mainly due to the application of smartphones in this area, research in human activity recognition (HAR) has shown a continuous and steady growth. Thanks to its wide range of sensors, its size, ... -
Optimization in Sanger sequencing
(Elsevier, 2019-09)[Abstract]: The main objective of this paper is to solve the optimization problem that is associated with the classification of DNA samples in PCR plates for Sanger sequencing. To achieve this goal, we design an integer ... -
Optimizing RPQs over a compact graph representation
(Springer, 2023-09-07)[Absctract]: We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (e.g., RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query over a ring: a compact ... -
Parallel construction of wavelet trees on multicore architectures
(Springer U K, 2016-10-05)[Abstract] The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem ... -
Proyecto COVIDBENS. Seguimiento de la pandemia de COVID-19 en aguas residuales del área metropolitana de A Coruña
(Sociedad Española de Sanidad Ambiental, 2022-05-18)[Resumen]: El virus SARS-CoV-2 está compuesto por una nucleocápside que engloba su material genético y la proteína N, rodeada por una membrana bilipídica, que contiene las proteínas M y E, y una corona de espinas, que ... -
Scalable processing and autocovariance computation of big functional data
(John Wiley & Sons, 2018)[Abstract]: This paper presents 2 main contributions. The first is a compact representation of huge sets of functional data or trajectories of continuous-time stochastic processes, which allows keeping the data always ... -
Space-Efficient Representations of Raster Time Series
(Elsevier, 2021)[Abstract] Raster time series, a.k.a. temporal rasters, are collections of rasters covering the same region at consecutive timestamps. These data have been used in many different applications ranging from weather forecast ... -
Space/time-efficient RDF stores based on circular suffix sorting
(Springer Nature, 2023-03)[Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed ... -
Stronger compact representations of object trajectories
(Taylor & Francis, 2024-02-13)[Absctract]: GraCT and ContaCT were the first compressed data structures to represent object trajectories, demonstrating that it was possible to use orders of magnitude less space than classical indexes while staying ... -
Succinct Encoding of Binary Strings Representing Triangulations
(Springer, 2021-11)[Abstract]: We consider the problem of designing a succinct data structure for representing the connectivity of planar triangulations. The main result is a new succinct encoding achieving the information-theory optimal ... -
Take one for the team: on the time efficiency of application-level buffer-aided relaying in edge cloud communication
(Springer, 2021-03-12)[Abstract] Background Adding buffers to networks is part of the fundamental advance in data communication. Since edge cloud computing is based on the heterogeneous collaboration network model in a federated environment, ... -
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
(Association for Computing Machinery (ACM), 2024-03-23)[Absctract]: We present an indexing scheme for triple-based graphs that supports join queries in worst-case optimal (wco) time within compact space. This scheme, called a ring, regards each triple as a cyclic string of ... -
TRGST: An enhanced generalized suffix tree for topological relations between paths
(Elsevier Ltd, 2024-11)[Abstract]: This paper introduces the TRGST data structure, which is designed to handle queries related to topological relations between paths represented as sequences of stops in a network. As an example, these paths could ... -
Two-Dimensional Block Trees
(Oxford University Press, 2024-01)[Absctract]: The Block Tree is a data structure for representing repetitive sequences in compressed space, which reaches space comparable with that of Lempel–Ziv compression while retaining fast direct access to any position ... -
Universal indexes for highly repetitive document collections
(Elsevier Ltd, 2016-11)[Abstract] 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 ...
