Search
Now showing items 1-10 of 51
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 ...
Energy Consumption in Compact Integer Vectors: A Study Case
(Institute of Electrical and Electronics Engineers, 2019-10-25)
[Abstract] In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy consumption. Moreover, most of the ...
GraCT: A Grammar-based Compressed Index for Trajectory Data
(Elsevier Ltd, 2019)
[Abstract]: We introduce a compressed data structure for the storage of free trajectories of moving objects that efficiently supports various spatio-temporal queries. Our structure, dubbed GraCT, stores the absolute positions ...
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 ...
Grammar compressed sequences with rank/select support
(Elsevier BV, 2016-10-14)
[Abstract] Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need ...
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 ...
Efficient Processing of Raster and Vector Data
(Public Library of Science, 2020-01-10)
[Abstract] In this work, we propose a framework to store and manage spatial data, which includes new efficient algorithms to perform operations accepting as input a raster dataset and a vector dataset. More concretely, we ...
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 ...
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. ...
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, ...