Graph analytics delivers deep knowledge by processing large volumes of highly connected
data. In real-world graphs, the degree distribution tends to follow the power law--a small …

In many graph-based applications, the graphs tend to grow, imposing a great challenge for
GPU-based graph processing. When the graph size exceeds the device memory capacity …

Motivation Scientists increasingly rely on intelligent information systems to help them in their
daily tasks, in particular for managing research objects, like publications or datasets. The …

Finding the shortest paths from a single source to all other vertices is a common problem in
graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single …

Finding the All-Pairs Shortest Paths (APSP) in a graph is the key for various domains.
Motivated by the graphs are sparse in most real-world applications, we store the whole …

Geodesic paths and distances are among the most popular intrinsic properties of 3D
surfaces. Traditionally, geodesic paths on discrete polygon surfaces were computed using …

This paper presents a new Single Source Shortest Path (SSSP) algorithm for GPUs. Our key
advancement is an improved work scheduler, which is central to the performance of SSSP …

Anomaly detection is an important task for hyperspectral data exploitation. Although many
algorithms have been developed for this purpose in recent years, due to the large …

This paper proposes a framework for the wireless sensor data acquisition using a team of
Unmanned Aerial Vehicles (UAVs). Scattered over a terrain, the sensors detect information …

In this paper, a directed network in which there is a specific percentage of loss for each arc is
considered. These losses are due to evaporation, leaks, energy dissipation, theft, etc. We …