Sciweavers

774 search results - page 9 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
JMLR
2012
11 years 11 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
AAAI
2012
11 years 11 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
PC
2002
158views Management» more  PC 2002»
13 years 8 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
ICASSP
2011
IEEE
13 years 13 days ago
A proportionate adaptive algorithm with variable partitioned block length for acoustic echo cancellation
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
CORR
2011
Springer
214views Education» more  CORR 2011»
13 years 14 days ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price