Morteza Ashraphijuo

Orcid: 0000-0001-9324-620X

According to our database1, Morteza Ashraphijuo authored at least 25 papers between 2014 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Fundamental sampling patterns for low-rank multi-view data completion.
Pattern Recognit., 2020

Structured Alternating Minimization for Union of Nested Low-Rank Subspaces Data Completion.
IEEE J. Sel. Areas Inf. Theory, 2020

Union of Low-Rank Tensor Spaces: Clustering and Completion.
J. Mach. Learn. Res., 2020

Characterization Of sampling patterns for low-tt-rank tensor retrieval.
Ann. Math. Artif. Intell., 2020

2019
Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method.
IEEE Trans. Signal Process., 2019

Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor.
IEEE Trans. Inf. Theory, 2019

Clustering a union of low-rank subspaces of different dimensions with missing data.
Pattern Recognit. Lett., 2019

Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval.
Ann. Math. Artif. Intell., 2019

2018
On the DoF of Two-Way 2×2×2 MIMO Relay Networks.
IEEE Trans. Veh. Technol., 2018

On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion.
IEEE Signal Process. Lett., 2018

A Characterization of Sampling Patterns for Union of Low-Rank Subspaces Retrieval Problem.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

2017
Rank Determination for Low-Rank Data Completion.
J. Mach. Learn. Res., 2017

Fundamental Conditions for Low-CP-Rank Tensor Completion.
J. Mach. Learn. Res., 2017

Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data.
CoRR, 2017

Scaled Nuclear Norm Minimization for Low-Rank Tensor Completion.
CoRR, 2017

Characterization of Deterministic and Probabilistic Sampling Patterns for Finite Completability of Low Tensor-Train Rank Tensor.
CoRR, 2017

A characterization of sampling patterns for low-rank multi-view data completion problem.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A characterization of sampling patterns for low-tucker-rank tensor completion problem.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

An approximation of the CP-rank of a partially sampled tensor.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Deterministic and Probabilistic Conditions for Finite Completability of Low Rank Tensor.
CoRR, 2016

Power system state estimation with a limited number of measurements.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

Characterization of rank-constrained feasibility problems via a finite number of convex programs.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

A strong semidefinite programming relaxation of the unit commitment problem.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015
Inverse function theorem for polynomial equations using semidefinite programming.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014
Promises of conic relaxation for contingency-constrained optimal power flow problem.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014


  Loading...