2555 search results - page 95 / 511 » Quantifiers and Working Memory |
WADS
2007
Springer
15 years 4 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
Currently run-time reconfigurable hardware offers really attractive features for embedded systems, such as flexibility, reusability, high performance and, in some cases, low-power...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
IPPS
2002
IEEE
15 years 3 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...