436 search results - page 33 / 88 » Recursion and Complexity |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
STOC
1994
ACM
13 years 12 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
ACTA
2004
13 years 7 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose a compressive method for tracking doubly selective channels within multicarrier systems, including OFDM systems. Using the recently introduced concept of modified comp...