Jacob D. Moorman

According to our database, Jacob D. Moorman authored at least 9 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Selectable Set Randomized Kaczmarz.

Yotam Yaniv, Jacob D. Moorman, William Swartworth, Thomas K. Tu, Daji Landis, Deanna Needell

Numer. Linear Algebra Appl., January, 2023

Structural Equivalence in Subgraph Matching.

Dominic Yang, Yurun Ge, Thien Nguyen, Denali Molitor, Jacob D. Moorman, Andrea L. Bertozzi

IEEE Trans. Netw. Sci. Eng., 2023

2021

Subgraph Matching on Multiplex Networks.

Jacob D. Moorman, Thomas K. Tu, Qinyi Chen, Xie He, Andrea L. Bertozzi

IEEE Trans. Netw. Sci. Eng., 2021

On Adaptive Sketch-and-Project for Solving Linear Systems.

Robert M. Gower, Denali Molitor, Jacob D. Moorman, Deanna Needell

SIAM J. Matrix Anal. Appl., 2021

Randomized Extended Kaczmarz is a Limit Point of Sketch-and-Project.

Benjamin Jarman, Nathan Mankovich, Jacob D. Moorman

CoRR, 2021

2020

Randomized Kaczmarz with Averaging.

Jacob D. Moorman, Thomas K. Tu, Denali Molitor, Deanna Needell

CoRR, 2020

Inexact Attributed Subgraph Matching.

Thomas K. Tu, Jacob D. Moorman, Dominic Yang, Qinyi Chen, Andrea L. Bertozzi

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Adaptive Sketch-and-Project Methods for Solving Linear Systems.

Robert M. Gower, Denali Molitor, Jacob D. Moorman, Deanna Needell

CoRR, 2019

2018

Filtering Methods for Subgraph Matching on Multiplex Networks.

Jacob D. Moorman, Qinyi Chen, Thomas K. Tu, Zachary M. Boyd, Andrea L. Bertozzi

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018