3047 search results - page 31 / 610 » Randomized Parallel Selection |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
DFG
1992
Springer
13 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
MST
2000
13 years 7 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
ISPA
2004
Springer
14 years 1 months ago
2004
Springer
