Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Keaton Hamm"'
Publikováno v:
Frontiers in Applied Mathematics and Statistics, Vol 7 (2021)
Externí odkaz:
https://doaj.org/article/5c4c1f70bce34b4fa0fb1557304fab2d
Publikováno v:
Frontiers in Applied Mathematics and Statistics, Vol 4 (2019)
A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces U=⋃Mi=1Si.
Externí odkaz:
https://doaj.org/article/31c6d8cfad564bed915af72997fce0b5
Autor:
Keaton Hamm
Publikováno v:
Linear Algebra and its Applications. 664:236-252
We characterize some variations of pseudoskeleton (also called CUR) decompositions for matrices and tensors over arbitrary fields. These characterizations extend previous results to arbitrary fields and to decompositions which use generalized inverse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef7232a1bbab96ec5dff6e117f779bfb
https://doi.org/10.1016/j.laa.2023.01.019
https://doi.org/10.1016/j.laa.2023.01.019
Autor:
Keaton Hamm
Publikováno v:
Proceedings of the Edinburgh Mathematical Society. 62:1163-1171
We investigate the Gibbs–Wilbraham phenomenon for generalized sampling series, and related interpolation series arising from cardinal functions. We prove the existence of the overshoot characteristic of the phenomenon for certain cardinal functions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3794e00c1b73855320f9fa71503d752c
https://doi.org/10.1017/s0013091519000166
https://doi.org/10.1017/s0013091519000166
Publikováno v:
Frontiers in Applied Mathematics and Statistics, Vol 7 (2021)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0153ffff7787b5500c3ce7772ca719c7
https://www.frontiersin.org/articles/10.3389/fams.2021.674785/full
https://www.frontiersin.org/articles/10.3389/fams.2021.674785/full
This paper considers the use of Robust PCA in a CUR decomposition framework and applications thereof. Our main algorithms produce a robust version of column-row factorizations of matrices $\mathbf{D}=\mathbf{L}+\mathbf{S}$ where $\mathbf{L}$ is low-r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::286ff7af38b234fb93176e96a2f57408
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030868376
WG
WG
An additive \(+\beta \) spanner of a graph G is a subgraph which preserves distances up to an additive \(+\beta \) error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted graphs [Elkin et a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd04a4601ae13b86540d57805a1276eb
https://doi.org/10.1007/978-3-030-86838-3_28
https://doi.org/10.1007/978-3-030-86838-3_28
Autor:
Longxiu Huang, Keaton Hamm
This article studies how to form CUR decompositions of low-rank matrices via primarily random sampling, though deterministic methods due to previous works are illustrated as well. The primary problem is to determine when a column submatrix of a rank
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::316dc45ef6d68f23c86f51d8ab3633db
Robust principal component analysis (RPCA) is a widely used tool for dimension reduction. In this work, we propose a novel non-convex algorithm, coined Iterated Robust CUR (IRCUR), for solving RPCA problems, which dramatically improves the computatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d84b1f9c928de1e8d3e43efed611e61d
Autor:
Jean-Luc Bouchot, Keaton Hamm
Publikováno v:
Sampling Theory in Signal and Image Processing. 16:37-53
We consider how some methods of uniform and nonuniform interpolation by translates of radial basis functions -- specifically the so-called general multiquadrics -- perform in the presence of certain types of noise. These techniques provide some new a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a08b5ee2813b1500dda653eea5b9635c
https://doi.org/10.1007/bf03549606
https://doi.org/10.1007/bf03549606