Now showing items 1-11 of 11

    • A Novel Two-Phase Approach to Forest Harvesting Optimization Using Cable Logging 

      Rey, Carlos; Sandoval, Simón; Cabrera-Vives, Guillermo; Seco, Diego; Cerulo, Pierluigi; Li, Zheng (Multidisciplinary Digital Publishing Institute (MDPI), 2023-11)
      [Abstract]: Timber extraction is a vital process in forest harvesting, particularly in areas with high slopes where timber harvesting methods are not feasible. In such cases, logging towers employing extraction cables are ...
    • Aggregated 2D range queries on clustered points 

      Bernardo, Guillermo de; Konow, Bernardo; Navarro, Gonzalo; Brisaboa, Nieves R.; Seco, Diego (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. ...
    • Boosting Perturbation-Based Iterative Algorithms to Compute the Median String 

      Mirabal, Pedro; Abreu Salas, José Ignacio; Seco, Diego; Pedreira, Óscar; Chávez, Edgar (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 ...
    • Compact representations of spatial hierarchical structures with support for topological queries 

      Fuentes Sepúlveda, José; Gatica, Diego; Navarro, Gonzalo; Rodríguez, M. Andrea; Seco, Diego (Elsevier Inc., 2023-06)
      [Abstract]: Among different spatial data models, the topological model for spatial regions explicitly represents common boundaries. This model pursues the efficiency of topology-related queries and the elimination of data ...
    • Faster compressed quadtrees 

      Bernardo, Guillermo de; Gagie, Travis; Ladra, Susana; Navarro, Gonzalo; Seco, Diego (Elsevier B.V., 2023-02)
      [Abstract]: Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using O(1) bits per node can break this bound ...
    • Microservice-oriented platform for internet of big data analytics: A proof of concept 

      Li, Zheng; Seco, Diego; Sánchez Rodríguez, Alexis Eloy (MDPI AG, 2019-03-01)
      [Abstract]: The ubiquitous Internet of Things (IoT) devices nowadays are generating various and numerous data from everywhere at any time. Since it is not always necessary to centralize and analyze IoT data cumulatively ...
    • Navigating planar topologies in near-optimal space and time 

      Fuentes Sepúlveda, José; Navarro, Gonzalo; Seco, Diego (Elsevier B.V., 2023-02)
      [Abstract]: We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that ...
    • Parallel construction of wavelet trees on multicore architectures 

      Fuentes Sepúlveda, José; Elejalde, Erick; Ferres, Leo; Seco, Diego (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 ...
    • Space-Efficient Representations of Raster Time Series 

      Silva-Coira, Fernando; Paramá, José R.; Bernardo, Guillermo de; Seco, Diego (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 ...
    • Succinct Encoding of Binary Strings Representing Triangulations 

      Fuentes Sepúlveda, José; Seco, Diego; Viaña, Raquel (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 ...
    • TRGST: An enhanced generalized suffix tree for topological relations between paths 

      Quijada Fuentes, Carlos; Rodríguez, M. Andrea; Seco, Diego (Elsevier Ltd, 2024-11)
      [Abstract]: This paper introduces the TRGST data structure, which is designed to handle queries related to topological relations between paths represented as sequences of stops in a network. As an example, these paths could ...