Sciweavers

486 search results - page 23 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
PDP
2010
IEEE
14 years 1 months ago
A Parallel Preconditioned Conjugate Gradient Solver for the Poisson Problem on a Multi-GPU Platform
- We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well sui...
Marco Ament, Günter Knittel, Daniel Weiskopf,...
DAGM
2003
Springer
14 years 27 days ago
Domain Decomposition for Parallel Variational Optical Flow Computation
We present an approach to parallel variational optical flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational proble...
Timo Kohlberger, Christoph Schnörr, Andr&eacu...
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
HPCC
2005
Springer
14 years 1 months ago
A Coarse Grained Parallel Algorithm for Closest Larger Ancestors in Trees with Applications to Single Link Clustering
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
Albert Chan, Chunmei Gao, Andrew Rau-Chaplin
WOB
2003
140views Bioinformatics» more  WOB 2003»
13 years 9 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....