Sciweavers

411 search results - page 6 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 14 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
14 years 1 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
SLSFS
2005
Springer
14 years 13 days ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss
JMLR
2012
11 years 9 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
ICDM
2007
IEEE
145views Data Mining» more  ICDM 2007»
14 years 1 months ago
Using Data Mining to Estimate Missing Sensor Data
Estimating missing sensor values is an inherent problem in sensor network applications; however, existing data estimation approaches do not apply well to the context of datastream...
Le Gruenwald, Hamed Chok, Mazen Aboukhamis