Sciweavers

481 search results - page 16 / 97
» A Fast Program Generator of Fast Fourier Transforms
Sort
View
IROS
2009
IEEE
184views Robotics» more  IROS 2009»
15 years 4 months ago
Fast and robust photomapping with an Unmanned Aerial Vehicle (UAV)
— A fast and robust method for visual odometry based on the Fourier-Mellin Invariant (FMI) descriptor is presented. It extends previous FMI based approaches in two ways. First, a...
Heikow Bülow, Andreas Birk
CASES
2006
ACM
15 years 3 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
82
Voted
VLSID
2005
IEEE
167views VLSI» more  VLSID 2005»
15 years 10 months ago
A Methodology and Tooling Enabling Application Specific Processor Design
This paper presents a highly efficient processor design methodology based on the LISA 2.0 language. Typically the architecture design phase is dominated by an iterative processor ...
Andreas Hoffmann, Frank Fiedler, Achim Nohl, Suren...
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 9 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts