default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuntao You
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]HanQin Cai, Longxiu Huang, Xiliang Lu, Juntao You:
Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent. CoRR abs/2406.07409 (2024)- [i8]Bowen Su, Juntao You, HanQin Cai, Longxiu Huang:
Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion. CoRR abs/2406.11092 (2024) - [i7]Licheng Dai, Xiliang Lu, Juntao You:
GraHTP: A Provable Newton-like Algorithm for Sparse Phase Retrieval. CoRR abs/2410.04034 (2024) - 2023
- [j4]HanQin Cai, Jian-Feng Cai, Juntao You
:
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion. SIAM J. Sci. Comput. 45(3): 1172-1198 (2023) - [j3]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
An Efficient Two-Stage SPARC Decoder for Massive MIMO Unsourced Random Access. IEEE Trans. Wirel. Commun. 22(11): 8275-8289 (2023) - 2022
- [j2]Jian-Feng Cai, Yuling Jiao, Xiliang Lu, Juntao You:
Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization. IEEE Trans. Signal Process. 70: 4951-4966 (2022) - [c2]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
Accelerated Maximum-Likelihood for Massive MIMO Unsourced Random Access. GLOBECOM 2022: 1576-1581 - [c1]Wenjie Wang, Juntao You, Shansuo Liang, Wei Han, Bo Bai:
Slotted Concatenated Coding Scheme for Asynchronous Uplink Unsourced Random Access with a Massive MIMO Receiver. PIMRC 2022: 246-252 - [i6]Juntao You, Wenjie Wang, Shansuo Liang, Wei Han, Bo Bai:
An Efficient Two-Stage SPARC Decoder for Massive MIMO Unsourced Random Access. CoRR abs/2203.03836 (2022) - [i5]HanQin Cai, Jian-Feng Cai, Juntao You:
Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion. CoRR abs/2204.03316 (2022) - [i4]Jian-Feng Cai, Jingyang Li, Juntao You:
Provable Sample-Efficient Sparse Phase Retrieval Initialized by Truncated Power Method. CoRR abs/2210.14628 (2022) - 2021
- [i3]Jian-Feng Cai, Yuling Jiao, Xiliang Lu, Juntao You:
Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization. CoRR abs/2112.07919 (2021) - 2020
- [i2]Jian-Feng Cai, Jingzhi Li, Xiliang Lu, Juntao You:
Sparse Signal Recovery From Phaseless Measurements via Hard Thresholding Pursuit. CoRR abs/2005.08777 (2020)
2010 – 2019
- 2019
- [j1]Juntao You, Yuling Jiao, Xiliang Lu, Tieyong Zeng:
A Nonconvex Model with Minimax Concave Penalty for Image Restoration. J. Sci. Comput. 78(2): 1063-1086 (2019) - [i1]Jianfeng Cai, Yuling Jiao, Xiliang Lu, Juntao You:
A stochastic alternating minimizing method for sparse phase retrieval. CoRR abs/1906.05967 (2019)
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-14 00:53 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:
