46 search results - page 1 / 10 » Efficient Parallel Mappings of a Dynamic Programming Algorit... |
IPPS
1993
IEEE
13 years 9 months ago
1993
IEEE
ALGORITHMICA
2006
13 years 5 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
ICDE
2010
IEEE
13 years 9 months ago
2010
IEEE
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
IJFCS
2006
13 years 4 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...