6105 search results - page 83 / 1221 » A Parallel Algorithm for Bound-Smoothing |
ANCS
2009
ACM
14 years 7 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
MST
2000
14 years 9 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we introduce a new parallel variant of the LLL lattice basis reduction algorithm. Our new, multi-threaded algorithm is the first to provide an efficient,...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
112
click to vote
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper describes a parallel algorithm for correlating or “fusing” streams of data from sensors and other sources of information. The algorithm is useful for applications w...