6105 search results - page 217 / 1221 » A Parallel Algorithm for Bound-Smoothing |
206
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
274
click to vote
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
256
click to vote
TOG
2012
13 years 8 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
169
click to vote
PDP
2006
IEEE
16 years 13 days ago
2006
IEEE
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
171
Voted
IJHPCA
2010
15 years 4 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...