Sciweavers

5448 search results - page 406 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2010
IEEE
15 years 4 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
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
16 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
ICS
2004
Tsinghua U.
16 years 5 days ago
A dynamic application-driven data communication strategy
The use of semi-Lagrangian formulations in numerical weather predication models (NWP) allows for an increase in time step size. Use of this method can increase performance of thes...
Paul van der Mark, Lex Wolters, Gerard Cats
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
16 years 29 days ago
ECGA vs. BOA in discovering stock market trading experts
This paper presents two evolutionary algorithms, ECGA and BOA, applied to constructing stock market trading expertise, which is built on the basis of a set of specific trading ru...
Piotr Lipinski
TIM
2010
129views Education» more  TIM 2010»
15 years 1 months ago
Experimental Evaluation of Feedback Modalities for Five Teleoperation Tasks
A distributed telerobotic system is proposed based on a master-arm station that is interconnected by a computer network to a slave-arm station. The distributed telerobotic system i...
Mayez A. Al-Mouhamed, Mohammad Nazeeruddin, S. M. ...