Sciweavers

2035 search results - page 71 / 407
» Working memory
Sort
View
IPPS
2007
IEEE
15 years 9 months ago
Parallel Audio Quick Search on Shared-Memory Multiprocessor Systems
Audio search plays an important role in analyzing audio data and retrieving useful audio information. In this paper, a Partially Overlapping Block-Parallel Active Search method (P...
Yurong Chen, Wei Wei, Yimin Zhang
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 9 months ago
Priority Queues Resilient to Memory Faults
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...
Allan Grønlund Jørgensen, Gabriel Mo...
IPPS
2006
IEEE
15 years 9 months ago
A configuration memory hierarchy for fast reconfiguration with reduced energy consumption overhead
Currently run-time reconfigurable hardware offers really attractive features for embedded systems, such as flexibility, reusability, high performance and, in some cases, low-power...
Elena Perez Ramo, Javier Resano, Daniel Mozos, Fra...
IPPS
2006
IEEE
15 years 9 months ago
Tree partition based parallel frequent pattern mining on shared memory systems
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...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...
IPPS
2002
IEEE
15 years 8 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
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...
Minsoo Jeon, Dongseung Kim