Results 101 to 110 of about 3,678,430 (211)
Sensado de Espectro con Matrix Completion IZMA-SD para Redes Radio Cognitiva
Debido al crecimiento de las redes inalámbricas, se hace necesario un uso eficiente del espectro, una solución es Radio Cognitivo. En una de las etapas de esta tecnología se realiza el sensado de espectro, es decir determinar en una frecuencia si ...
Olger Ferledy Erazo De La Cruz +2 more
doaj +1 more source
Near-Optimal Weighted Matrix Completion
Recent work in the matrix completion literature has shown that prior knowledge of a matrix's row and column spaces can be successfully incorporated into reconstruction programs to substantially benefit matrix recovery. This paper proposes a novel methodology that exploits more general forms of known matrix structure in terms of subspaces.
openaire +3 more sources
Matrix completion and tensor rank [PDF]
In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
openaire +2 more sources
Enhancing Matrix Completion Using a Modified Second-Order Total Variation
In this paper, we propose a new method to deal with the matrix completion problem. Different from most existing matrix completion methods that only pursue the low rank of underlying matrices, the proposed method simultaneously optimizes their low rank ...
Wendong Wang, Jianjun Wang
doaj +1 more source
Efficient Forecasting Scheme and Optimal Delivery Approach of Energy for the Energy Internet
The energy Internet (EI) is an important infrastructure for effectively utilizing and intelligently managing renewable energy sources (RES). In this paper, we study the architecture design of the EI under the backdrop of large-scale RES grid connection ...
Liufeng Du +3 more
doaj +1 more source
Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more general model assumes that each column of X corresponds to one of several low-rank matrices.
openaire +2 more sources
Matrix completion under interval uncertainty
Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it ...
Mareček, Jakub +2 more
openaire +3 more sources
A Designed Thresholding Operator for Low-Rank Matrix Completion
In this paper, a new thresholding operator, namely, designed thresholding operator, is designed to recover the low-rank matrices. With the change of parameter in designed thresholding operator, the designed thresholding operator can apply less bias to ...
Angang Cui, Haizhen He, Hong Yang
doaj +1 more source
Analysis of Nuclear Norm Regularization for Full-rank Matrix Completion
In this paper, we provide a theoretical analysis of the nuclear-norm regularized least squares for full-rank matrix completion. Although similar formulations have been examined by previous studies, their results are unsatisfactory because only additive ...
Jin, Rong +3 more
core

