Keaton Hamm

Nick Henscheid

Shujie Kang

SIAM J. Math. Data Sci., June, 2023

Manifold learning in Wasserstein space.

[BibT_eX]

[DOI]

CoRR, 2023

Lattice Approximations in Wasserstein Space.

[BibT_eX]

[DOI]

Varun Khurana

CoRR, 2023

On Wasserstein distances for affine transformations of random vectors.

[BibT_eX]

[DOI]

Andrzej Korzeniowski

CoRR, 2023

Boosting Nyström Method.

[BibT_eX]

[DOI]

CoRR, 2023

Linearized Wasserstein dimensionality reduction with approximation guarantees.

[BibT_eX]

[DOI]

CoRR, 2023

Multi-priority Graph Sparsification.

[BibT_eX]

[DOI]

Abu Reyan Ahmed

Faryad Darabi Sahneh

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

2022

Generalized Pseudoskeleton Decompositions.

[BibT_eX]

[DOI]

CoRR, 2022

Riemannian CUR Decompositions for Robust Principal Component Analysis.

[BibT_eX]

[DOI]

Mohamed Meskini

HanQin Cai

Proceedings of the Topological, 2022

2021

Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation.

[BibT_eX]

[DOI]

IEEE Signal Process. Lett., 2021

Perturbations of CUR Decompositions.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2021

Robust CUR Decomposition: Theory and Imaging Applications.

[BibT_eX]

[DOI]

SIAM J. Imaging Sci., 2021

Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Editorial: Mathematical Fundamentals of Machine Learning.

[BibT_eX]

[DOI]

Frontiers Appl. Math. Stat., 2021

Computing Steiner Trees using Graph Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2021

On Matrix Factorizations in Subspace Clustering.

[BibT_eX]

[DOI]

Reeshad Arian

CoRR, 2021

Weighted Sparse and Lightweight Spanners with Local Additive Error.

[BibT_eX]

[DOI]

CoRR, 2021

On Additive Spanners in Weighted Graphs with Local Error.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Multi-Level Weighted Additive Spanners.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

Graph spanners: A tutorial review.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2020

Stability of Sampling for CUR Decompositions.

[BibT_eX]

[DOI]

CoRR, 2020

Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Perspectives on CUR Decompositions.

[BibT_eX]

[DOI]

CoRR, 2019

A General Framework for Multi-level Subsetwise Graph Sparsifiers.

[BibT_eX]

[DOI]

Abu Reyan Ahmed

Faryad Darabi Sahneh

CoRR, 2019

CUR Decompositions, Approximations, and Perturbations.

[BibT_eX]

[DOI]

CoRR, 2019

Approximation Algorithms and an Integer Program for Multi-level Graph Spanners.

[BibT_eX]

[DOI]

Abu Reyan Ahmed

Faryad Darabi Sahneh

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

CUR Decompositions, Similarity Matrices, and Subspace Clustering.

[BibT_eX]

[DOI]

Frontiers Appl. Math. Stat., 2018

Cardinal interpolation with general multiquadrics: convergence rates.

[BibT_eX]

[DOI]

Jeff Ledford

Adv. Comput. Math., 2018

2017

Matrix resconstruction: Skeleton decomposition versus singular value decomposition.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2017

Principal coordinate clustering.

[BibT_eX]

[DOI]

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

2016

Cardinal interpolation with general multiquadrics.

[BibT_eX]

[DOI]

Jeff Ledford

Adv. Comput. Math., 2016

2015

Approximation rates for interpolation of Sobolev functions via Gaussians and allied functions.

[BibT_eX]

[DOI]