Sciweavers

625 search results - page 6 / 125
» On one algorithm for solving the problem of source function ...
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
An efficient algorithm for compressed MR imaging using total variation and wavelets
Compressed sensing, an emerging multidisciplinary field involving mathematics, probability, optimization, and signal processing, focuses on reconstructing an unknown signal from a...
Shiqian Ma, Wotao Yin, Yin Zhang, Amit Chakraborty
ICASSP
2011
IEEE
12 years 11 months ago
Can one hear the shape of a room: The 2-D polygonal case
We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RI...
Ivan Dokmanic, Yue M. Lu, Martin Vetterli
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
TSP
2008
118views more  TSP 2008»
13 years 7 months ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel