Search Results for author: Huda Nassar

Found 3 papers, 1 papers with code

Julia for Biologists

1 code implementation21 Sep 2021 Elisabeth Roesch, Joe G. Greener, Adam L. MacLean, Huda Nassar, Christopher Rackauckas, Timothy E. Holy, Michael P. H. Stumpf

Increasing emphasis on data and quantitative methods in the biomedical sciences is making biological research more computational.

Dominant Z-Eigenpairs of Tensor Kronecker Products are Decoupled and Applications to Higher-Order Graph Matching

no code implementations17 Nov 2020 Charles Colley, Huda Nassar, David Gleich

This theorem implies low rank structure ought to be present in the iterates of tensor power methods on Kronecker products.

Graph Matching

Low rank methods for multiple network alignment

no code implementations21 Sep 2018 Huda Nassar, Georgios Kollias, Ananth Grama, David F. Gleich

While there are a large number of effective techniques for pairwise problems with two networks that scale in terms of edges, these cannot be readily extended to align multiple networks as the computational complexity will tend to grow exponentially with the number of networks. In this paper we introduce a new multiple network alignment algorithm and framework that is effective at aligning thousands of networks with thousands of nodes.

Cannot find the paper you are looking for? You can Submit a new open access paper.