activity
20212026
collaborators
Showing 2025Show all

7 papers · 1 filter

cs.DC2025

Anonymized Network Sensing using C++26 std::execution on GPUs

Michael Mandulak, Sayan Ghosh, S M Ferdous +2

Large-scale network sensing plays a vital role in network traffic analysis and characterization. As network packet data grows increasingly large, parallel methods have become mains…

cs.DB2025

ApproxJoin: Approximate Matching for Efficient Verification in Fuzzy Set Similarity Join

Michael Mandulak, S M Ferdous, Sayan Ghosh +2

The set similarity join problem is a fundamental problem in data processing and discovery, relying on exact similarity measures between sets. In the presence of alterations, such a…

cs.DS2025

Weighted Matching in a Poly-Streaming Model

Ahammed Ullah, S. M. Ferdous, Alex Pothen

We introduce the poly-streaming model, a generalization of streaming models of computation in which processors process data streams containing a total of items. The alg…

cs.SI2025

ELRUHNA: Elimination Rule-basedHypergraph Alignment

Cameron Ibrahim, S M Ferdous, Ilya Safro +2

Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despi…

cs.SI2025

GNN-Based Candidate Node Predictor for Influence Maximization in Temporal Graphs

Priyanka Gautam, Balasubramaniam Natarajan, Sai Munikoti +2

In an age where information spreads rapidly across social media, effectively identifying influential nodes in dynamic networks is critical. Traditional influence maximization strat…

cs.LG2025

SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks

Siddhartha Shankar Das, Naheed Anjum Arafat, Muftiqur Rahman +3

We propose SGS-GNN, a novel supervised graph sparsifier that learns the sampling probability distribution of edges and samples sparse subgraphs of a user-specified size to reduce t…

cs.DS2025

Semi-Streaming Algorithms for Hypergraph Matching

Henrik Reinstädtler, S M Ferdous, Alex Pothen +2

We propose two one-pass streaming algorithms for the -hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a sta…