Sciweavers

186 search results - page 10 / 38
» Fast Computation of Sparse Datacubes
Sort
View
ICIP
2009
IEEE
13 years 6 months ago
Structured pursuits for geometric super-resolution
Super-resolution image zooming is possible when the image has some geometric regularity. We introduce a general class of non-linear inverse estimators, which combines linear estima...
Stéphane Mallat, Guoshen Yu
CAP
2010
13 years 3 months ago
A high-performance algorithm for calculating cyclotomic polynomials
The nth cyclotomic polynomial, n(z), is the monic polynomial whose (n) distinct roots are the nth primitive roots of unity. n(z) can be computed efficiently as a quotient of terms...
Andrew Arnold, Michael B. Monagan
DCC
2000
IEEE
14 years 29 days ago
The Skip-Innovation Model for Sparse Images
On sparse images, contiguous runs of identical symbols often occur in the same coding context. This paper proposes a model for efficiently encoding such runs in a twodimensional s...
Paul J. Ausbeck Jr.
CHINAF
2008
69views more  CHINAF 2008»
13 years 8 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
DAC
1996
ACM
14 years 21 days ago
Efficient Full-Wave Electromagnetic Analysis via Model-Order Reduction of Fast Integral Transforms
Abstract-An efficient full-wave electromagnetic analysis tool would be useful in many aspects of engineering design. Development of integral-equation based tools has been hampered ...
Joel R. Philips, Eli Chiprout, David D. Ling