Sciweavers

575 search results - page 37 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
ACL
2009
14 years 7 months ago
A Beam-Search Extraction Algorithm for Comparable Data
This paper extends previous work on extracting parallel sentence pairs from comparable data (Munteanu and Marcu, 2005). For a given source sentence S, a maximum entropy (ME) class...
Christoph Tillmann
IPPS
1999
IEEE
15 years 2 months ago
A Transformational Framework for Skeletal Programs: Overview and Case Study
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...
Sergei Gorlatch, Susanna Pelagatti
ISPAN
1997
IEEE
15 years 1 months ago
CASS: an efficient task management system for distributed memory architectures
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
Jing-Chiou Liou, Michael A. Palis
PARA
2000
Springer
15 years 1 months ago
Ship Hull Hydrodynamic Analysis Using Distributed Shared Memory
Abstract. In this article we present the results obtained from the execution of a commercial Computational Fluid Dynamics program on a cluster of personal computers. The communicat...
João P. Marques Silva, Paulo Guedes
PPOPP
2009
ACM
15 years 10 months ago
Mapping parallelism to multi-cores: a machine learning based approach
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
Zheng Wang, Michael F. P. O'Boyle