Sciweavers

583 search results - page 85 / 117
» New algorithms for efficient parallel string comparison
Sort
View
PR
2011
14 years 9 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
CF
2008
ACM
15 years 4 months ago
Fpga-based prototype of a pram-on-chip processor
PRAM (Parallel Random Access Model) has been widely regarded a desirable parallel machine model for many years, but it is also believed to be "impossible in reality." As...
Xingzhi Wen, Uzi Vishkin
ASAP
2000
IEEE
90views Hardware» more  ASAP 2000»
15 years 6 months ago
Subword Permutation Instructions for Two-Dimensional Multimedia Processing in MicroSIMD Architectures
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
Ruby B. Lee
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 1 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
103
Voted
ICSE
2008
IEEE-ACM
16 years 2 months ago
Temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...
Jinjun Chen, Yun Yang