652 search results - page 109 / 131 » Linear Explicit Substitutions |
121
Voted
JGO
2010
14 years 9 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
140
click to vote
TIP
2010
14 years 9 months ago
2010
Multiframe super-resolution (SR) reconstruction of small moving objects against a cluttered background is difficult for two reasons: a small object consists completely of "mix...
103
click to vote
TSP
2010
14 years 9 months ago
2010
We consider efficient methods for the recovery of block-sparse signals--i.e., sparse signals that have nonzero entries occurring in clusters--from an underdetermined system of line...
146
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
130
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...