GI-LBD - Artigos: Envíos recentes

Mostrando ítems 26-30 de 49

    • New machine learning approaches for real-life human activity recognition using smartphone sensor-based data 

      García-González, Daniel; Rivero, Daniel; Fernández-Blanco, Enrique; Rodríguez Luaces, Miguel (Elsevier B.V., 2023)
      [Abstract]: In recent years, mainly due to the application of smartphones in this area, research in human activity recognition (HAR) has shown a continuous and steady growth. Thanks to its wide range of sensors, its size, ...

    • Compact and indexed representation for LiDAR point clouds 

      Ladra, Susana; Rodríguez Luaces, Miguel; Paramá, José R.; Silva-Coira, Fernando (Taylor & Francis, 2022)
      [Abstract]: LiDAR devices are capable of acquiring clouds of 3D points reflecting any object around them, and adding additional attributes to each point such as color, position, time, etc. LiDAR datasets are usually large, ...

    • Graph Compression for Adjacency-Matrix Multiplication 

      Francisco, Alexandre P.; Gagie, Travis; Köppl, Dominik; Ladra, Susana; Navarro, Gonzalo (Springer, 2022)
      [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 ...

    • Combining Multiple Granularity Variability in a Software Product Line Approach for Web Engineering 

      Horcas Aguilera, José Miguel; Cortiñas, Alejandro; Fuentes, Lidia; Rodríguez Luaces, Miguel (Elsevier, 2022)
      [Abstract] Context: Web engineering involves managing a high diversity of artifacts implemented in different languages and with different levels of granularity. Technological companies usually implement variable artifacts ...

    • 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 ...