A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

Multifeatures Graph-Cut Algorithm for Extraction of Buildings From Large-Scale Urban LiDAR Data

Abstract: Building extraction from airborne LiDAR data is significant for the accurate modeling of urban structures and constitutes a pivotal step in urban 3-D reconstruction. However, in complex ...
IEEE

BDoG-Net: Algorithm Unrolling for Blind Deconvolution on Graphs

Abstract: Starting from first graph signal processing (GSP) principles, we present a novel model-based deep learning approach to blind deconvolution of sparse graph signals. Despite the bilinear ...
GitHub

EECS 281: Data Structures and Algorithms, 24 Fall

Welcome to my 281 archive! This notes include implementations of basic data structures: union-find sets, unordered_map by hash table, AVL tree, graph represented by adjacency matrix&list and a lot ...
GitHub

Basic shortest-path algorithm implementations

Class: BSFSolver Description: Finds the shortest path in a weighted graph using a queue (LinkedList). Expands nodes in the order they are discovered. Class: DijkstraSolver Description: Finds the ...