Buscar
Mostrando ítems 21-30 de 58
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 ...
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 ...
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 ...
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 ...
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, ...
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. ...
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication
(IEEE Computer Society, 2018-03)
[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 ...
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, ...
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 ...
Succinct Data Structures in the Realm of GIS
(MDPI, 2021)
[Abstract] Geographic Information Systems (GIS) have spread all over our technological environment in the last decade. The inclusion of GPS technologies in everyday portable devices along with the creation of massive ...