2766 search results - page 23 / 554 » Algorithms for trigonometric polynomials |
156
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
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...
100
Voted
PPSC
1997
15 years 5 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
104
Voted
JSC
2002
15 years 3 months ago
2002
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
118
Voted
STOC
1999
ACM
15 years 8 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
134
Voted
ALT
2004
Springer
16 years 19 days ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...