default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeaton Hamm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i25]Brian Bell, Michael Geyer, David Glickenstein, Keaton Hamm, Carlos Scheidegger, Amanda S. Fernandez, Juston Moore:
Persistent Classification: A New Approach to Stability of Data and Adversarial Examples. CoRR abs/2404.08069 (2024)- 2023
- [j11]Keaton Hamm
, Nick Henscheid, Shujie Kang:
Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning. SIAM J. Math. Data Sci. 5(2): 475-501 (2023) - [c8]Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence:
Multi-priority Graph Sparsification. IWOCA 2023: 1-12 - [i24]Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence:
Multi-Priority Graph Sparsification. CoRR abs/2301.12563 (2023) - [i23]Alexander Cloninger, Keaton Hamm, Varun Khurana, Caroline Moosmüller:
Linearized Wasserstein dimensionality reduction with approximation guarantees. CoRR abs/2302.07373 (2023) - [i22]Keaton Hamm, Zhaoying Lu, Wenbo Ouyang, Hao Helen Zhang:
Boosting Nyström Method. CoRR abs/2302.11032 (2023) - [i21]Keaton Hamm, Andrzej Korzeniowski:
On Wasserstein distances for affine transformations of random vectors. CoRR abs/2310.03945 (2023) - [i20]Keaton Hamm, Varun Khurana:
Lattice Approximations in Wasserstein Space. CoRR abs/2310.09149 (2023) - [i19]Keaton Hamm, Caroline Moosmüller, Bernhard Schmitzer, Matthew Thorpe:
Manifold learning in Wasserstein space. CoRR abs/2311.08549 (2023) - 2022
- [c7]Keaton Hamm, Mohamed Meskini, HanQin Cai:
Riemannian CUR Decompositions for Robust Principal Component Analysis. TAG-ML 2022: 152-160 - [i18]Keaton Hamm, Nick Henscheid, Shujie Kang:
Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning. CoRR abs/2204.06645 (2022) - [i17]Keaton Hamm, Mohamed Meskini, HanQin Cai:
Riemannian CUR Decompositions for Robust Principal Component Analysis. CoRR abs/2206.09042 (2022) - [i16]Keaton Hamm:
Generalized Pseudoskeleton Decompositions. CoRR abs/2206.14905 (2022) - 2021
- [j10]David Glickenstein, Keaton Hamm, Xiaoming Huo, Yajun Mei, Martin Stoll:
Editorial: Mathematical Fundamentals of Machine Learning. Frontiers Appl. Math. Stat. 7: 674785 (2021) - [j9]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions. J. Mach. Learn. Res. 22: 185:1-185:36 (2021) - [j8]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. SIAM J. Imaging Sci. 14(4): 1472-1503 (2021) - [j7]Keaton Hamm, Longxiu Huang:
Perturbations of CUR Decompositions. SIAM J. Matrix Anal. Appl. 42(1): 351-375 (2021) - [j6]HanQin Cai, Keaton Hamm, Longxiu Huang, Jiaqi Li, Tao Wang:
Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation. IEEE Signal Process. Lett. 28: 116-120 (2021) - [c6]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-Level Weighted Additive Spanners. SEA 2021: 16:1-16:23 - [c5]Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
On Additive Spanners in Weighted Graphs with Local Error. WG 2021: 361-373 - [i15]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. CoRR abs/2101.05231 (2021) - [i14]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Multi-level Weighted Additive Spanners. CoRR abs/2102.05831 (2021) - [i13]Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Weighted Sparse and Lightweight Spanners with Local Additive Error. CoRR abs/2103.09731 (2021) - [i12]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions. CoRR abs/2103.11037 (2021) - [i11]Reeshad Arian, Keaton Hamm:
On Matrix Factorizations in Subspace Clustering. CoRR abs/2106.12016 (2021) - [i10]Abu Reyan Ahmed, Md Asadullah Turja, Faryad Darabi Sahneh, Mithun Ghosh, Keaton Hamm, Stephen G. Kobourov:
Computing Steiner Trees using Graph Neural Networks. CoRR abs/2108.08368 (2021) - 2020
- [j5]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence:
Graph spanners: A tutorial review. Comput. Sci. Rev. 37: 100253 (2020) - [c4]Abu Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem. ESA 2020: 4:1-4:21 - [i9]Keaton Hamm, Longxiu Huang:
Stability of Sampling for CUR Decompositions. CoRR abs/2001.02774 (2020) - [i8]HanQin Cai, Keaton Hamm, Longxiu Huang, Jiaqi Li, Tao Wang:
Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation. CoRR abs/2010.07422 (2020)
2010 – 2019
- 2019
- [c3]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
Approximation Algorithms and an Integer Program for Multi-level Graph Spanners. SEA² 2019: 541-562 - [i7]Keaton Hamm, Longxiu Huang:
CUR Decompositions, Approximations, and Perturbations. CoRR abs/1903.09698 (2019) - [i6]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
Approximation algorithms and an integer program for multi-level graph spanners. CoRR abs/1904.01135 (2019) - [i5]Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Faryad Darabi Sahneh, Richard Spence:
A General Framework for Multi-level Subsetwise Graph Sparsifiers. CoRR abs/1905.00536 (2019) - [i4]Keaton Hamm, Longxiu Huang:
Perspectives on CUR Decompositions. CoRR abs/1907.12668 (2019) - [i3]Keaton Hamm, Longxiu Huang:
Perturbations of CUR Decompositions. CoRR abs/1908.08101 (2019) - [i2]Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, Richard Spence:
Graph Spanners: A Tutorial Review. CoRR abs/1909.03152 (2019) - 2018
- [j4]Keaton Hamm, Jeff Ledford:
Cardinal interpolation with general multiquadrics: convergence rates. Adv. Comput. Math. 44(4): 1205-1233 (2018) - [j3]Akram Aldroubi, Keaton Hamm, Ahmet Bugra Koku, Ali Sekmen:
CUR Decompositions, Similarity Matrices, and Subspace Clustering. Frontiers Appl. Math. Stat. 4: 65 (2018) - 2017
- [c2]Ali Sekmen, Akram Aldroubi, Ahmet Bugra Koku, Keaton Hamm:
Principal coordinate clustering. IEEE BigData 2017: 2095-2101 - [c1]Ali Sekmen, Akram Aldroubi, Ahmet Bugra Koku, Keaton Hamm:
Matrix resconstruction: Skeleton decomposition versus singular value decomposition. SPECTS 2017: 1-8 - [i1]Akram Aldroubi, Keaton Hamm, Ahmet Bugra Koku, Ali Sekmen:
CUR Decompositions, Similarity Matrices, and Subspace Clustering. CoRR abs/1711.04178 (2017) - 2016
- [j2]Keaton Hamm, Jeff Ledford:
Cardinal interpolation with general multiquadrics. Adv. Comput. Math. 42(5): 1149-1186 (2016) - 2015
- [j1]Keaton Hamm:
Approximation rates for interpolation of Sobolev functions via Gaussians and allied functions. J. Approx. Theory 189: 101-122 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
