![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Mohammed Rayyan Sheriff
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j3]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Novel Min-Max Reformulations of Linear Inverse Problems. J. Mach. Learn. Res. 23: 28:1-28:46 (2022) - 2021
- [j2]Mishal Assif P. K., Mohammed Rayyan Sheriff, Debasish Chatterjee:
Measure of quality of finite-dimensional linear systems: A frame-theoretic view. Syst. Control. Lett. 151: 104911 (2021) - 2017
- [j1]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Optimal Dictionary for Least Squares Representation. J. Mach. Learn. Res. 18: 107:1-107:28 (2017)
Conference and Workshop Papers
- 2019
- [c2]Mohammed Rayyan Sheriff, Masaaki Nagahara:
State-space Realization of Linear Time-invariant Systems with Maximum Measure of Quality. ASCC 2019: 1376-1379 - 2017
- [c1]Mohammed Rayyan Sheriff, Debasish Chatterjee:
On a frame theoretic measure of quality of LTI systems. CDC 2017: 4012-4017
Informal and Other Publications
- 2023
- [i9]Mohammed Rayyan Sheriff, Peyman Mohajerin Esfahani:
Nonlinear Distributionally Robust Optimization. CoRR abs/2306.03202 (2023) - 2022
- [i8]Mohammed Rayyan Sheriff, Floor Fenne Redel, Peyman Mohajerin Esfahani:
Fast Algorithm for Constrained Linear Inverse Problems. CoRR abs/2212.01068 (2022) - 2020
- [i7]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Novel min-max reformulations of Linear Inverse Problems. CoRR abs/2007.02448 (2020) - 2019
- [i6]Mishal Assif P. K.
, Mohammed Rayyan Sheriff, Debasish Chatterjee:
Measure of quality of finite-dimensional linear systems: A frame-theoretic view. CoRR abs/1902.04548 (2019) - [i5]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Convex geometry of the Coding problem for error constrained Dictionary Learning. CoRR abs/1908.06065 (2019) - [i4]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Dictionary Learning with Almost Sure Error Constraints. CoRR abs/1910.08828 (2019) - 2017
- [i3]Mohammed Rayyan Sheriff, Debasish Chatterjee:
On a frame theoretic measure of quality of LTI systems. CoRR abs/1703.07539 (2017) - [i2]Mohammed Rayyan Sheriff, Debasish Chatterjee:
A complete characterization of optimal dictionaries for least squares representation. CoRR abs/1710.06763 (2017) - 2016
- [i1]Mohammed Rayyan Sheriff, Debasish Chatterjee:
Optimal dictionary for least squares representation. CoRR abs/1603.02074 (2016)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint