Sciweavers

899 search results - page 29 / 180
» fast 2009
Sort
View
DAC
2009
ACM
13 years 10 months ago
Fast vectorless power grid verification using an approximate inverse technique
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
Nahi H. Abdul Ghani, Farid N. Najm
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
13 years 10 months ago
Fast Motif Selection for Biological Sequences
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
Pavel P. Kuksa, Vladimir Pavlovic
SIGOPS
2010
91views more  SIGOPS 2010»
13 years 5 months ago
FastAD: an authenticated directory for billions of objects
We develop techniques that make authenticated directories efficient and scalable toward the goal of managing tens of billions of objects in a single directory. Internet storage s...
Paul T. Stanton, Benjamin McKeown, Randal C. Burns...
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
13 years 4 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
EGH
2009
Springer
13 years 4 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....