Sciweavers

1497 search results - page 113 / 300
» A Computational Model for Message Passing
Sort
View
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 9 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
EUROPAR
2007
Springer
14 years 2 months ago
Parallel Nearest Neighbour Algorithms for Text Categorization
In this paper we describe the parallelization of two nearest neighbour classification algorithms. Nearest neighbour methods are well-known machine learning techniques. They have be...
Reynaldo Gil-García, José Manuel Bad...
CLUSTER
2006
IEEE
14 years 2 months ago
FAIL-MPI: How Fault-Tolerant Is Fault-Tolerant MPI?
One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence in Grid infrastructures and in large-sca...
William Hoarau, Pierre Lemarinier, Thomas Hé...
ICPR
2010
IEEE
14 years 2 months ago
Constrained Energy Minimization for Matching-Based Image Recognition
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
Tobias Gass, Philippe Dreuw, Hermann Ney
ICS
2005
Tsinghua U.
14 years 1 months ago
Automatic generation and tuning of MPI collective communication routines
In order for collective communication routines to achieve high performance on different platforms, they must be able to adapt to the system architecture and use different algori...
Ahmad Faraj, Xin Yuan