Sciweavers

2634 search results - page 40 / 527
» Faster Than Uppaal
Sort
View
JCB
2000
105views more  JCB 2000»
13 years 8 months ago
A Greedy Algorithm for Aligning DNA Sequences
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...
TCAD
1998
83views more  TCAD 1998»
13 years 8 months ago
Telescopic units: a new paradigm for performance optimization of VLSI designs
—This paper introduces a novel optimization paradigm for increasing the throughput of digital systems. The basic idea consists of transforming fixed-latency units into variable-...
Luca Benini, Enrico Macii, Massimo Poncino, Giovan...
TFS
2008
190views more  TFS 2008»
13 years 8 months ago
A Fast Geometric Method for Defuzzification of Type-2 Fuzzy Sets
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
Simon Coupland, Robert John
ICPR
2010
IEEE
13 years 7 months ago
Incremental Training of Multiclass Support Vector Machines
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
Symeon Nikitidis, Nikos Nikolaidis, Ioannis Pitas
IPPS
2010
IEEE
13 years 6 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