2949 search results - page 106 / 590 » Universal Sparse Modeling |
165
click to vote
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
107
Voted
ICA
2007
Springer
15 years 4 months ago
2007
Springer
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
122
Voted
UAI
2008
15 years 2 months ago
2008
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our a...
124
click to vote
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
94
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is...