Robust Matrix Completion With Deterministic Sampling via Convex Optimization.

Wang Y, Li W, Fowler JE, Vivone G

Open source

DOI
10.1109/tpami.2026.3659200
Published
2026 Jun
Container
IEEE transactions on pattern analysis and machine intelligence
Publisher
Not recorded
Open access
unknown

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/tpami.2026.3659200,
  title = {Robust Matrix Completion With Deterministic Sampling via Convex Optimization.},
  author = {Wang Y and Li W and Fowler JE and Vivone G},
  year = {2026},
  journal = {IEEE transactions on pattern analysis and machine intelligence},
  doi = {10.1109/tpami.2026.3659200},
  url = {https://doi.org/10.1109/tpami.2026.3659200}
}

RIS

TY  - JOUR
TI  - Robust Matrix Completion With Deterministic Sampling via Convex Optimization.
AU  - Wang Y
AU  - Li W
AU  - Fowler JE
AU  - Vivone G
PY  - 2026
JO  - IEEE transactions on pattern analysis and machine intelligence
DO  - 10.1109/tpami.2026.3659200
UR  - https://doi.org/10.1109/tpami.2026.3659200
ER  - 

APA

Y, W., W, L., JE, F., & G, V. (2026). Robust Matrix Completion With Deterministic Sampling via Convex Optimization.. IEEE transactions on pattern analysis and machine intelligence. https://doi.org/10.1109/tpami.2026.3659200

Source records