Buscar
Mostrando ítems 1-10 de 10
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 ...
Efficient Representation of Multidimensional Data over Hierarchical Domains
(Springer, 2016-09-21)
[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of ...
Improved Compressed String Dictionaries
(ACM, 2019-11-03)
[Abstract] We introduce a new family of compressed data structures to efficiently store and query large string dictionaries in main memory. Our main technique is a combination of hierarchical Front-coding with ideas from ...
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 ...
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 ...
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 ...
Managing Compressed Structured Text
(Springer Nature, 2018-12-07)
[Definition]: Compressing structured text is the problem of creating a reduced-space representation from which the original
data can be re-created exactly. Compared to plain text compression, the goal is to take advantage ...
Revisiting Compact RDF Stores Based on k2-Trees
(IEEE Xplore, 2020-03)
[Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary ...
Extending general compact querieable representations to GIS applications
(Elsevier, 2020-01)
[Abstract]: The raster model is commonly used for the representation of images in many domains, and is especially useful in Geographic Information Systems (GIS) to store information about continuous variables of the space ...
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 ...