1176 search results - page 71 / 236 » Sparse reward processes |
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
It has been previously demonstrated that systems based on block wise local features and Gaussian mixture models (GMM) are suitable for video based talking face verification due t...
125
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Technological constraints severely limit the rate at which analog-todigital converters can reliably sample signals. Recently, Tropp et al. proposed an architecture, termed the ran...
146
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
143
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
124
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...