Sciweavers

6939 search results - page 620 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
CLUSTER
2008
IEEE
15 years 8 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
IPPS
1994
IEEE
15 years 10 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
EGH
2009
Springer
15 years 4 months ago
Data-parallel rasterization of micropolygons with defocus and motion blur
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for ra...
Kayvon Fatahalian, Edward Luong, Solomon Boulos, K...
EUROPAR
2007
Springer
16 years 24 days ago
On Detecting Termination in the Crash-Recovery Model
We investigate the problem of detecting termination of a distributed computation in an asynchronous message-passing system where processes may crash and recover. We show that it is...
Felix C. Freiling, Matthias Majuntke, Neeraj Mitta...
CCECE
2006
IEEE
16 years 21 days ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner