160 search results - page 8 / 32 » Sparse decompositions in |
101
click to vote
SIAMCOMP
1998
14 years 10 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
JMLR
2010
14 years 5 months ago
2010
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
94
Voted
CVPR
2007
IEEE
16 years 13 days ago
2007
IEEE
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
112
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
84
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...