Listar GI-LBD - Artigos por data de publicación
Mostrando ítems 21-35 de 35
-
Lossless Compression of Industrial Time Series With Direct Access
(Elsevier, 2021)[Abstract] The new opportunities generated by the data-driven economy in the manufacturing industry have causedmany companies opt for it. However, the size of time series data that need to be captured creates theproblem ... -
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 ... -
An index for moving objects with constant-time access to their compressed trajectories
(Taylor & Francis, 2021)[Abstract]: As the number of vehicles and devices equipped with GPS technology has grown explosively, an urgent need has arisen for time- and space-efficient data structures to represent their trajectories. The most commonly ... -
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, ... -
Modeling the Number of People Infected With SARS-COV-2 From Wastewater Viral Load in Northwest Spain
(Elsevier, 2022)[Abstract] The quantification of the SARS-CoV-2 RNA load in wastewater has emerged as a useful tool to monitor COVID–19 outbreaks in the community. This approach was implemented in the metropolitan area of A Coruña (NW ... -
Combining Multiple Granularity Variability in a Software Product Line Approach for Web Engineering
(Elsevier, 2022)[Abstract] Context: Web engineering involves managing a high diversity of artifacts implemented in different languages and with different levels of granularity. Technological companies usually implement variable artifacts ... -
Graph Compression for Adjacency-Matrix Multiplication
(Springer, 2022)[Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ... -
Compact and indexed representation for LiDAR point clouds
(Taylor & Francis, 2022)[Abstract]: LiDAR devices are capable of acquiring clouds of 3D points reflecting any object around them, and adding additional attributes to each point such as color, position, time, etc. LiDAR datasets are usually large, ... -
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, ... -
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 ... -
Map algebra on raster datasets represented by compact data structures
(John Wiley and Sons, 2023-06)[Abstract]: The increase in the size of data repositories has forced the design of new computing paradigms to be able to process large volumes of data in a reasonable amount of time. One of them is in-memory computing, ... -
Compressed and queryable self-indexes for RDF archives
(Springer Nature, 2023-08)[Abstract]: 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 ... -
Fed-mRMR: A lossless federated feature selection method
(Elsevier, 2024-05)[Abstract]: Feature selection has become a mandatory task in data mining, due to the overwhelming amount of features in Big Data problems. To handle this high-dimensional data and avoid the well-known curse of dimensionality, ... -
Classic distance join queries using compact data structures
(Elsevier, 2024-07)[Abstract]: Distance-based Join Queries (DJQs) have multiple applications in spatial databases, Geographic Information Systems, and other areas. The K Closest Pairs Query (KCPQ) and the 𝜀� Distance Join Query (𝜀� DJQ) ... -
Local features: Enhancing variability modeling in software product lines
(Elsevier, 2024-07)[Abstract]: Context and motivation: Software Product Lines (SPL) enable the creation of software product families with shared core components using feature models to model variability. Choosing features from a feature model ...
