default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMorteza Ashraphijuo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Morteza Ashraphijuo, Xiaodong Wang:
Characterization Of sampling patterns for low-tt-rank tensor retrieval. Ann. Math. Artif. Intell. 88(8): 859-886 (2020)- [j11]Morteza Ashraphijuo, Xiaodong Wang:
Union of Low-Rank Tensor Spaces: Clustering and Completion. J. Mach. Learn. Res. 21: 69:1-69:36 (2020) - [j10]Morteza Ashraphijuo
, Xiaodong Wang:
Structured Alternating Minimization for Union of Nested Low-Rank Subspaces Data Completion. IEEE J. Sel. Areas Inf. Theory 1(3): 632-644 (2020) - [j9]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
Fundamental sampling patterns for low-rank multi-view data completion. Pattern Recognit. 103: 107307 (2020)
2010 – 2019
- 2019
- [j8]Morteza Ashraphijuo, Xiaodong Wang:
Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval. Ann. Math. Artif. Intell. 87(4): 373-393 (2019) - [j7]Morteza Ashraphijuo, Xiaodong Wang:
Clustering a union of low-rank subspaces of different dimensions with missing data. Pattern Recognit. Lett. 120: 31-35 (2019) - [j6]Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor. IEEE Trans. Inf. Theory 65(9): 5380-5400 (2019) - [j5]Morteza Ashraphijuo, Xiaodong Wang, Junwei Zhang:
Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method. IEEE Trans. Signal Process. 67(7): 1849-1859 (2019) - 2018
- [j4]Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion. IEEE Signal Process. Lett. 25(3): 343-347 (2018) - [j3]Mehdi Ashraphijuo, Morteza Ashraphijuo, Xiaodong Wang:
On the DoF of Two-Way 2×2×2 MIMO Relay Networks. IEEE Trans. Veh. Technol. 67(11): 10554-10563 (2018) - [c9]Morteza Ashraphijuo, Xiaodong Wang:
A Characterization of Sampling Patterns for Union of Low-Rank Subspaces Retrieval Problem. ISAIM 2018 - 2017
- [j2]Morteza Ashraphijuo, Xiaodong Wang:
Fundamental Conditions for Low-CP-Rank Tensor Completion. J. Mach. Learn. Res. 18: 63:1-63:29 (2017) - [j1]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
Rank Determination for Low-Rank Data Completion. J. Mach. Learn. Res. 18: 98:1-98:29 (2017) - [c8]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
An approximation of the CP-rank of a partially sampled tensor. Allerton 2017: 604-611 - [c7]Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
A characterization of sampling patterns for low-tucker-rank tensor completion problem. ISIT 2017: 531-535 - [c6]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
A characterization of sampling patterns for low-rank multi-view data completion problem. ISIT 2017: 1147-1151 - [i7]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data. CoRR abs/1701.00737 (2017) - [i6]Morteza Ashraphijuo, Xiaodong Wang:
Characterization of Deterministic and Probabilistic Sampling Patterns for Finite Completability of Low Tensor-Train Rank Tensor. CoRR abs/1703.07698 (2017) - [i5]Morteza Ashraphijuo, Xiaodong Wang:
Fundamental Conditions for Low-CP-Rank Tensor Completion. CoRR abs/1703.10740 (2017) - [i4]Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
Rank Determination for Low-Rank Data Completion. CoRR abs/1707.00622 (2017) - [i3]Morteza Ashraphijuo, Xiaodong Wang:
Scaled Nuclear Norm Minimization for Low-Rank Tensor Completion. CoRR abs/1707.07976 (2017) - [i2]Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion. CoRR abs/1712.01628 (2017) - 2016
- [c5]Ramtin Madani, Morteza Ashraphijuo, Javad Lavaei, Ross Baldick:
Power system state estimation with a limited number of measurements. CDC 2016: 672-679 - [c4]Morteza Ashraphijuo, Salar Fattahi, Javad Lavaei, Alper Atamtürk:
A strong semidefinite programming relaxation of the unit commitment problem. CDC 2016: 694-701 - [c3]Morteza Ashraphijuo, Ramtin Madani, Javad Lavaei:
Characterization of rank-constrained feasibility problems via a finite number of convex programs. CDC 2016: 6544-6550 - [i1]Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
Deterministic and Probabilistic Conditions for Finite Completability of Low Rank Tensor. CoRR abs/1612.01597 (2016) - 2015
- [c2]Morteza Ashraphijuo, Ramtin Madani, Javad Lavaei:
Inverse function theorem for polynomial equations using semidefinite programming. CDC 2015: 6589-6596 - 2014
- [c1]Ramtin Madani, Morteza Ashraphijuo, Javad Lavaei:
Promises of conic relaxation for contingency-constrained optimal power flow problem. Allerton 2014: 1064-1071
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-09-13 00:42 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:
