default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElad Romanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Elad Romanov, Gil Kur, Boaz Nadler:
Tyler's and Maronna's M-estimators: Non-asymptotic concentration results. J. Multivar. Anal. 196: 105184 (2023)- [i10]Elad Romanov:
On the Noise Sensitivity of the Randomized SVD. CoRR abs/2305.17435 (2023) - 2022
- [c3]Elad Romanov, Or Ordentlich:
Spiked Covariance Estimation from Modulo-Reduced Measurements. AISTATS 2022: 1298-1320 - [c2]Elad Romanov, Tamir Bendory, Or Ordentlich:
On the Role of Channel Capacity in Learning Gaussian Mixture Models. COLT 2022: 4110-4159 - [i9]Elad Romanov, Tamir Bendory, Or Ordentlich:
On the Role of Channel Capacity in Learning Gaussian Mixture Models. CoRR abs/2202.07707 (2022) - [i8]Matan Gavish, William E. Leeb, Elad Romanov:
Matrix Denoising with Partial Noise Statistics: Optimal Singular Value Shrinkage of Spiked F-Matrices. CoRR abs/2211.00986 (2022) - 2021
- [b1]Elad Romanov:
Selected Problems in Signal Estimation and Recovery : By Elad Romanov. (כותר נוסף בעברית: בעיות נבחרות בשערוך אותות). Hebrew University of Jerusalem, Israel, 2021 - [j5]Elad Romanov
, Or Ordentlich:
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. Entropy 23(5): 605 (2021) - [j4]Elad Romanov, Tamir Bendory, Or Ordentlich:
Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition. SIAM J. Math. Data Sci. 3(2): 494-523 (2021) - [j3]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. IEEE Trans. Inf. Theory 67(3): 1897-1919 (2021) - [j2]William E. Leeb, Elad Romanov:
Optimal Spectral Shrinkage and PCA With Heteroscedastic Noise. IEEE Trans. Inf. Theory 67(5): 3009-3037 (2021) - [i7]Elad Romanov, Or Ordentlich:
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. CoRR abs/2105.05350 (2021) - [i6]Elad Romanov, Or Ordentlich:
Spiked Covariance Estimation from Modulo-Reduced Measurements. CoRR abs/2110.01150 (2021) - 2020
- [i5]Elad Romanov, Tamir Bendory, Or Ordentlich:
Multi-reference alignment in high dimensions: sample complexity and phase transition. CoRR abs/2007.11482 (2020)
2010 – 2019
- 2019
- [j1]Elad Romanov, Or Ordentlich:
Above the Nyquist Rate, Modulo Folding Does Not Hurt. IEEE Signal Process. Lett. 26(8): 1167-1171 (2019) - [c1]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. ISIT 2019: 2329-2333 - [i4]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. CoRR abs/1901.10396 (2019) - [i3]Elad Romanov, Or Ordentlich:
Above the Nyquist Rate, Modulo Folding Does Not Hurt. CoRR abs/1903.12289 (2019) - 2018
- [i2]Elad Romanov, Matan Gavish:
The Noise-Sensitivity Phase Transition in Spectral Group Synchronization Over Compact Groups. CoRR abs/1803.03287 (2018) - 2017
- [i1]Elad Romanov, Matan Gavish:
Near-optimal matrix recovery from random linear measurements. CoRR abs/1705.09958 (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-04-25 05:56 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:
