719 search results - page 76 / 144 » Solving Sparse Linear Constraints |
81
Voted
TIT
2010
14 years 7 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
144
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
101
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
80
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
We evaluate the effectiveness of neural networks as a tool for predicting whether a particular combination of preconditioner and iterative method will correctly solve a given spar...
COLT
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...