Sciweavers

21 search results - page 2 / 5
» Generating and Searching Families of FFT Algorithms
Sort
View
ICESS
2004
Springer
13 years 11 months ago
Relating FFTW and Split-Radix
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
Oleg Kiselyov, Walid Taha
DAGSTUHL
2006
13 years 7 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
FPGA
2006
ACM
139views FPGA» more  FPGA 2006»
13 years 10 months ago
Fast and accurate resource estimation of automatically generated custom DFT IP cores
This paper presents an equation-based resource utilization model for automatically generated discrete Fourier transform (DFT) soft core IPs. The parameterized DFT IP generator all...
Peter A. Milder, Mohammad Ahmad, James C. Hoe, Mar...
BMCBI
2010
105views more  BMCBI 2010»
13 years 6 months ago
Subdivision of the MDR superfamily of medium-chain dehydrogenases/reductases through iterative hidden Markov model refinement
Background: The Medium-chain Dehydrogenases/Reductases (MDR) form a protein superfamily whose size and complexity defeats traditional means of subclassification; it currently has ...
Joel Hedlund, Hans Jörnvall, Bengt Persson
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang