Buscar
Mostrando ítems 1-7 de 7
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 ...
Space-Efficient Representations of Raster Time Series
(Elsevier, 2021)
[Abstract] Raster time series, a.k.a. temporal rasters, are collections of rasters covering the same region at consecutive timestamps. These data have been used in many different applications ranging from weather forecast ...
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, ...
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 ...
Multilevel Modeling of Geographic Information Systems Based on International Standards
(SpringerLink, 2021)
[Abstract] Even though different applications based on Geographic Information Systems (GIS) provide different features and functions, they all share a set of common concepts (e.g., spatial data types, operations, services), ...
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 ...
Succinct Encoding of Binary Strings Representing Triangulations
(Springer, 2021-11)
[Abstract]: We consider the problem of designing a succinct data structure for representing the connectivity of planar triangulations. The main result is a new succinct encoding achieving the information-theory optimal ...