2556 search results - page 145 / 512 » Clustering processes |
139
click to vote
SASP
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
234
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
126
Voted
MMM
2005
Springer
15 years 9 months ago
2005
Springer
In recent years, relevance feedback has been studied extensively as a way to improve performance of content-based image retrieval (CBIR). However, since users are usually unwillin...
128
click to vote
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Performance analysis for terascale computing requires a combination of new concepts including distribution, on-line processing and automation. As a foundation for tools r...
123
click to vote
DSN
2000
IEEE
15 years 8 months ago
2000
IEEE
Recent work has shown the advantages of using persistent memory for transaction processing. In particular, the Vista transaction system uses recoverable memory to avoid disk I/O, ...