10213 search results - page 141 / 2043 » An Experimental Analysis of Parallel |
CONCURRENCY
2010
13 years 2 months ago
2010
PLDI
2012
ACM
11 years 10 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...
PPOPP
1999
ACM
14 years 5 days ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
IMCSIT
2010
13 years 2 months ago
2010
The present paper is aimed to compare the efficiency of a new segmentation method with several existing approaches. The paper addresses the problem of image segmentation evaluation...
ALGORITHMICA
2006
13 years 8 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...