理学 >>> 数学 信息科学与系统科学 物理学 化学 天文学 地球科学总论 大气科学 地球物理学 地理学 地质学 水文学 海洋科学 生物学 科学技术史
搜索结果: 1-11 共查到理学 matrix completion相关记录11条 . 查询时间(0.109 秒)
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from colla...
Let M be a random nα × n matrix of rank r n, and assume that a uniformly random subset E of its entries is observed. We describe an ecient algorithm that reconstructs M from |E| = O(r ...
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. ...
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxat...
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applica...
On the heels of compressed sensing, a remarkable new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data m...
In this paper we address the problem of estimating the attitudes and positions of a set of cameras in an external coordinate system. Starting from a conventional global structure-from-motion pipeline,...
Here we show that the problem of realizing a polytope with specified combinatorics is equivalent to a low rank matrix completion problem.This is comparable to known results reducing realizability to s...
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle.
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case.We analyze the associated random ob...
Kabanets and Impagliazzo [9] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial f...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...