Listar Laboratorio de Bases de Datos (LBD) por título
Mostrando ítems 1-20 de 51
-
3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories
(Springer, 2018)[Abstract]: Much research has been published about trajectory management on the ground or at the sea, but compression or indexing of flight trajectories have usually been less explored. However, air traffic management is ... -
A New Method to Index and Store Spatio-Temporal Data
(2016-11-16)[Abstract] We propose a data structure that stores, in a compressed way, object trajectories, which at the same time, allow to efficiently response queries without the need to decompress the data. We use a data structure, ... -
A Public Domain Dataset for Real-Life Human Activity Recognition Using Smartphone Sensors
(MDPI AG, 2020-04-13)[Abstract] In recent years, human activity recognition has become a hot topic inside the scientific community. The reason to be under the spotlight is its direct application in multiple domains, like healthcare or fitness. ... -
A succinct data structure for self-indexing ternary relations
(Elsevier BV, 2016-10-27)[Abstract] The representation of binary relations has been intensively studied and many different theoretical and practical representations have been proposed to answer the usual queries in multiple domains. However, ternary ... -
Accessible Routes Integrating Data from Multiple Sources
(MDPI AG, 2020-12-26)[Abstract] Providing citizens with the ability to move around in an accessible way is a requirement for all cities today. However, modeling city infrastructures so that accessible routes can be computed is a challenge ... -
Aggregated 2D range queries on clustered points
(Elsevier Ltd, 2016-09)[Abstract] Efficient processing of aggregated range queries on two-dimensional grids is a common requirement in information retrieval and data mining systems, for example in Geographic Information Systems and OLAP cubes. ... -
An Action Research for Improving the Sustainability Assessment Framework Instruments
(MDPI AG, 2020-02-24)[Abstract] In the last years, software engineering researchers have defined sustainability as a quality requirement of software, but not enough effort has been devoted to develop new methods/techniques to support the ... -
An Architecture for Software Engineering Gamification
(Qinghua Daxue Xuebao Bianjibu,Tsinghua University, Editorial Board, 2020-05-07)[Abstract] Gamification has been applied in software engineering to improve quality and results by increasing people's motivation and engagement. A systematic mapping has identified research gaps in the field, one of them ... -
An Efficient Representation of Enriched Temporal Trajectories
(SciTePress, 2021)[Abstract] We present a novel representation of enriched trajectories of a mobile workforce management system. In this system, employees are tracked during their working day and both their routes and the tasks performed ... -
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 ... -
Augmented Thresholds for MONI
(Institute of Electrical and Electronics Engineers Inc., 2023)[Abstract]: MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. In this paper we consider its one-pass ... -
Automatic group-wise whole-brain short association fiber bundle labeling based on clustering and cortical surface information
(BioMed Central Ltd., 2020-06-03)[Abstract] Background Diffusion MRI is the preferred non-invasive in vivo modality for the study of brain white matter connections. Tractography datasets contain 3D streamlines that can be analyzed to study the main ... -
Boosting Perturbation-Based Iterative Algorithms to Compute the Median String
(IEEE, 2021)[Abstract] The most competitive heuristics for calculating the median string are those that use perturbation-based iterative algorithms. Given the complexity of this problem, which under many formulations is NP-hard, the ... -
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 ... -
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, ... -
Compact Trip Representation over Networks
(Springer, 2016-09-21)[Abstract] We present a new Compact Trip Representation ( CTRCTR ) that allows us to manage users’ trips (moving objects) over networks. These could be public transportation networks (buses, subway, trains, and so on) where ... -
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 ... -
Compressed Data Structures for Binary Relations in Practice
(Institute of Electrical and Electronics Engineers, 2020-01-31)[Abstract] Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent ... -
Design of Mutation Operators for Testing Geographic Information Systems
(M D P I AG, 2019-08-06)[Abstract] In this article, we propose the definition of specific mutation operators for testing Geographic Information Systems. We describe the process for applying the operators and generating mutants, and present a case ... -
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
(Springer, 2016-09-21)[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
