507 search results - page 34 / 102 » Computing Sparse Multiples of Polynomials |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
ICCV
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
RECOMB
1997
Springer
13 years 12 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...