Buscar
Mostrando ítems 1-10 de 42
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
From Coarse to Fine-Grained Parcellation of the Cortical Surface Using a Fiber-Bundle Atlas
(Frontiers Research Foundation, 2020-09-10)
[Abstract] In this article, we present a hybrid method to create fine-grained parcellations of the cortical surface, from a coarse-grained parcellation according to an anatomical atlas, based on cortico-cortical connectivity. ...