Sciweavers

7393 search results - page 301 / 1479
» Synthesis-for-testability using transformations
Sort
View
ICCVW
1999
Springer
15 years 8 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
ICIP
2010
IEEE
15 years 1 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Christopher K. Turnes, Justin K. Romberg
EC
2006
118views ECommerce» more  EC 2006»
15 years 4 months ago
Human-Competitive Evolution of Quantum Computing Artefacts by Genetic Programming
We show how Genetic Programming (GP) can be used to evolve useful quantum computing artefacts of increasing sophistication and usefulness: firstly specific quantum circuits, then ...
Paul Massey, John A. Clark, Susan Stepney
DCC
2004
IEEE
16 years 4 months ago
Coding for Fast Access to Image Regions Defined by Pixel Range
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
Amir Said, Sehoon Yea, William A. Pearlman
FP
1989
124views Formal Methods» more  FP 1989»
15 years 8 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones