Sciweavers

358 search results - page 27 / 72
» Sparse squares of polynomials
Sort
View
ICA
2010
Springer
13 years 9 months ago
An Alternating Minimization Method for Sparse Channel Estimation
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutt...
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 4 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
JSC
2007
106views more  JSC 2007»
13 years 8 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
ICASSP
2009
IEEE
14 years 3 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 9 months ago
Chunky and Equal-Spaced Polynomial Multiplication
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
Daniel S. Roche