5785 search results - page 442 / 1157 » Approximability of Probability Distributions |
170
click to vote
JMIV
2002
15 years 6 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
173
click to vote
ACL
2009
15 years 4 months ago
2009
Variational EM has become a popular technique in probabilistic NLP with hidden variables. Commonly, for computational tractability, we make strong independence assumptions, such a...
179
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
215
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
165
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...