GitHub

Parallel Minimum Spanning Tree (MST) using Borůvka's Algorithm

This project provides a massively parallel implementation of a Minimum Spanning Tree (MST) graph algorithm using NVIDIA CUDA. The implementation is based on Borůvka's algorithm, which is highly ...
IEEE

Efficient Algorithms for Computing Random Walk Centrality

Abstract: Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes.
Frontiers

Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery

Introduction: Accurate identification of forest tree species is essential for sustainable forest management, biodiversity assessment, and environmental monitoring. Urban forests, in particular, ...
eLife

Microbial consortia in salt marsh sediments are sequentially buried over millennia and genomic complementarity analysis indicates an important role in complex carbon decomposition

This study provides a valuable genome-centric characterization of microbial communities across deep sediment cores from a Spartina patens salt marsh. The study provides claims on the metabolic ...
IEEE

Fair Communication Coverage and Energy Efficiency Optimization of Multiple UAVs Based on Deep Reinforcement Learning

Abstract: Unmanned aerial vehicles (UAVs) function as airborne base stations, improving communication networks in challenging scenarios like remote area emergency responses. Drone swarms facilitate ...