Sciweavers

2297 search results - page 13 / 460
» A fast APRIORI implementation
Sort
View
88
Voted
IPPS
2010
IEEE
14 years 8 months ago
Fast Smith-Waterman hardware implementation
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
Zubair Nawaz, Koen Bertels, Huseyin Ekin Sumbul
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
14 years 8 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
DATE
2004
IEEE
125views Hardware» more  DATE 2004»
15 years 1 months ago
Fast Comparisons of Circuit Implementations
Abstract-- Digital designs can be mapped to different implementations using diverse approaches, with varying cost criteria. Post-processing transforms, such as transistor sizing ca...
Shrirang K. Karandikar, Sachin S. Sapatnekar
C3S2E
2009
ACM
15 years 4 months ago
CPU, SMP and GPU implementations of Nohalo level 1, a fast co-convex antialiasing image resampler
This article introduces Nohalo level 1 (“Nohalo”), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear...
Nicolas Robidoux, Minglun Gong, John Cupitt, Adam ...
PPOPP
2012
ACM
13 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank