Sciweavers

7150 search results - page 9 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 2 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 9 months ago
Optimal Column-Based Low-Rank Matrix Reconstruction
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Venkatesan Guruswami, Ali Kemal Sinop
131
Voted
WWW
2009
ACM
16 years 3 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
PVLDB
2010
97views more  PVLDB 2010»
15 years 24 days ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 2 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky