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

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

StableRoute: When Dijkstra's Algorithm Meets Topology-Varying Satellite Networks

Abstract: Low Earth Orbit (LEO) satellite constellations are becoming a viable means for Internet access. However, their topology changes as satellites move towards or away from orbital intersection ...
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

A Pre-Communication Mechanism for Evolutionary Multitasking Optimization

This repository contains the MATLAB implementation for the paper: "A Pre-Communication Mechanism for Evolutionary Multitasking Optimization". This work introduces a novel Pre-Communication Mechanism ...