default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLongxiu Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]HanQin Cai
, Zehan Chao, Longxiu Huang, Deanna Needell:
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruptions. SIAM J. Imaging Sci. 17(1): 225-247 (2024)- [j10]Juefei Chen, Longxiu Huang, Yimin Wei:
Coseparable Nonnegative Tensor Factorization with t-CUR Decomposition. SIAM J. Matrix Anal. Appl. 45(4): 1805-1826 (2024) - [j9]Longxiu Huang, Xia Li, Deanna Needell:
Randomized Kaczmarz in Adversarial Distributed Setting. SIAM J. Sci. Comput. 46(3): 354- (2024) - [c8]HanQin Cai, Longxiu Huang, Chandra Kundu, Bowen Su:
On the Robustness of Cross-Concentrated Sampling for Matrix Completion. CISS 2024: 1-5 - [c7]Huikang Liu, Peng Wang, Longxiu Huang, Qing Qu, Laura Balzano:
Symmetric Matrix Completion with ReLU Sampling. ICML 2024 - [i26]HanQin Cai, Longxiu Huang, Chandra Kundu, Bowen Su:
On the Robustness of Cross-Concentrated Sampling for Matrix Completion. CoRR abs/2401.15566 (2024) - [i25]Juefei Chen, Longxiu Huang, Yimin Wei:
Coseparable Nonnegative Tensor Factorization With T-CUR Decomposition. CoRR abs/2401.16836 (2024) - [i24]Huikang Liu, Peng Wang, Longxiu Huang, Qing Qu, Laura Balzano:
Symmetric Matrix Completion with ReLU Sampling. CoRR abs/2406.05822 (2024) - [i23]HanQin Cai, Longxiu Huang, Xiliang Lu, Juntao You:
Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent. CoRR abs/2406.07409 (2024) - [i22]Bowen Su, Juntao You, HanQin Cai, Longxiu Huang:
Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion. CoRR abs/2406.11092 (2024) - [i21]Longxiu Huang, A. Martina Neuman, Sui Tang, Yuying Xie:
Convolutional dynamical sampling and some new results. CoRR abs/2406.15122 (2024) - [i20]Longxiu Huang, Dongyang Li, Sui Tang, Qing Yao:
Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field. CoRR abs/2410.18005 (2024) - 2023
- [j8]HanQin Cai, Longxiu Huang, Pengyu Li, Deanna Needell:
Matrix Completion With Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling. IEEE Trans. Pattern Anal. Mach. Intell. 45(8): 10100-10113 (2023) - [c6]Zheng Tan, Longxiu Huang, HanQin Cai, Yifei Lou:
Non-Convex Approaches for Low-Rank Tensor Completion under Tubal Sampling. ICASSP 2023: 1-5 - [c5]Qing Yao, Longxiu Huang, Sui Tang:
Space-Time Variable Density Samplings for Sparse Bandlimited Graph Signals Driven by Diffusion Operators. ICASSP 2023: 1-5 - [c4]Katherine Henneberger, Longxiu Huang, Jing Qin:
Hyperspectral Band Selection Based on Matrix CUR Decomposition. IGARSS 2023: 7380-7383 - [i19]Longxiu Huang, Xia Li, Deanna Needell:
Distributed Randomized Kaczmarz for the Adversarial Workers. CoRR abs/2302.14615 (2023) - [i18]Zheng Tan, Longxiu Huang, HanQin Cai, Yifei Lou:
Non-convex approaches for low-rank tensor completion under tubal sampling. CoRR abs/2303.12721 (2023) - [i17]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption. CoRR abs/2305.04080 (2023) - 2022
- [j7]Pengyu Li, Christine Tseng, Yaxuan Zheng, Joyce A. Chew, Longxiu Huang, Benjamin Jarman, Deanna Needell:
Guided Semi-Supervised Non-Negative Matrix Factorization. Algorithms 15(5): 136 (2022) - [i16]Pengyu Li, Christine Tseng, Yaxuan Zheng, Joyce A. Chew, Longxiu Huang, Benjamin Jarman, Deanna Needell:
Guided Semi-Supervised Non-negative Matrix Factorization on Legal Documents. CoRR abs/2201.13324 (2022) - [i15]Xia Li, Longxiu Huang, Deanna Needell:
Distributed randomized Kaczmarz for the adversarial workers. CoRR abs/2203.00095 (2022) - [i14]HanQin Cai, Longxiu Huang, Pengyu Li, Deanna Needell:
Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling. CoRR abs/2208.09723 (2022) - 2021
- [j6]Zehan Chao, Longxiu Huang, Deanna Needell:
HOSVD-Based Algorithm for Weighted Tensor Completion. J. Imaging 7(7): 110 (2021) - [j5]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) - [j4]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. SIAM J. Imaging Sci. 14(4): 1472-1503 (2021) - [j3]Keaton Hamm, Longxiu Huang:
Perturbations of CUR Decompositions. SIAM J. Matrix Anal. Appl. 42(1): 351-375 (2021) - [j2]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) - [c3]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition *. ICCVW 2021: 189-197 - [i13]HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell:
Robust CUR Decomposition: Theory and Imaging Applications. CoRR abs/2101.05231 (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]HanQin Cai, Zehan Chao, Longxiu Huang, Deanna Needell:
Fast Robust Tensor Principal Component Analysis via Fiber CUR Decomposition. CoRR abs/2108.10448 (2021) - [i10]Akram Aldroubi, Longxiu Huang, Keri Kornelson, Ilya A. Krishtal:
Predictive algorithms in dynamical sampling for burst-like forcing terms. CoRR abs/2109.00623 (2021) - [i9]Longxiu Huang, Deanna Needell, Sui Tang:
Robust recovery of bandlimited graph signals via randomized dynamical sampling. CoRR abs/2109.14079 (2021) - 2020
- [c2]Rachel Grotheer, Longxiu Huang, Yihuan Huang, Alona Kryshchenko, Oleksandr Kryshchenko, Pengyu Li, Xia Li, Elizaveta Rebrova, Kyung Ha, Deanna Needell:
COVID-19 Literature Topic-Based Search via Hierarchical NMF. NLP4COVID@EMNLP 2020 - [c1]Zehan Chao, Longxiu Huang, Deanna Needell:
Tensor Completion through Total Variation with Initialization from Weighted HOSVD. ITA 2020: 1-8 - [i8]Keaton Hamm, Longxiu Huang:
Stability of Sampling for CUR Decompositions. CoRR abs/2001.02774 (2020) - [i7]Longxiu Huang, Deanna Needell:
HOSVD-Based Algorithm for Weighted Tensor Completion. CoRR abs/2003.08537 (2020) - [i6]Zehan Chao, Longxiu Huang, Deanna Needell:
Tensor Completion through Total Variationwith Initialization from Weighted HOSVD. CoRR abs/2003.09062 (2020) - [i5]Rachel Grotheer, Yihuan Huang, Pengyu Li, Elizaveta Rebrova, Deanna Needell, Longxiu Huang, Alona Kryshchenko, Xia Li, Kyung Ha, Oleksandr Kryshchenko:
COVID-19 Literature Topic-Based Search via Hierarchical NMF. CoRR abs/2009.09074 (2020) - [i4]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
- [i3]Keaton Hamm, Longxiu Huang:
CUR Decompositions, Approximations, and Perturbations. CoRR abs/1903.09698 (2019) - [i2]Keaton Hamm, Longxiu Huang:
Perspectives on CUR Decompositions. CoRR abs/1907.12668 (2019) - [i1]Keaton Hamm, Longxiu Huang:
Perturbations of CUR Decompositions. CoRR abs/1908.08101 (2019) - 2017
- [j1]Longxiu Huang, Tao Wang:
On the Number of Neighbors in Normal Tiling. SIAM J. Discret. Math. 31(1): 240-253 (2017)
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-11-28 21:26 CET 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:
