Sciweavers

524 search results - page 15 / 105
» Two efficient methods to reduce power and testing time
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
13 years 8 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
BMCBI
2010
150views more  BMCBI 2010»
13 years 5 months ago
Kernel based methods for accelerated failure time model with ultra-high dimensional data
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...
Zhenqiu Liu, Dechang Chen, Ming Tan, Feng Jiang, R...
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
14 years 1 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara
DAC
1996
ACM
14 years 17 days ago
Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
Eric Verlind, Gjalt G. de Jong, Bill Lin
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
14 years 1 months ago
Two improved differential evolution schemes for faster global search
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty