Sciweavers

154 search results - page 21 / 31
» The truncated fourier transform and applications
Sort
View
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
14 years 26 days ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
IMAGING
2004
13 years 9 months ago
Fast Re-integration of Shadow Free Images
In imaging applications, computation is often carried out in a derivative (gradient) domain. For example, we can attenuate small image differences by thresholding the gradient and...
Clément Fredembach, Graham D. Finlayson
PAMI
2006
99views more  PAMI 2006»
13 years 7 months ago
A New Convexity Measure Based on a Probabilistic Interpretation of Images
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
Esa Rahtu, Mikko Salo, Janne Heikkilä
TWC
2008
148views more  TWC 2008»
13 years 7 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...