Sciweavers

5802 search results - page 302 / 1161
» Parallelizing Feature Selection
Sort
View
ISHPC
1999
Springer
15 years 8 months ago
Dynamically Adaptive Parallel Programs
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
Michael Voss, Rudolf Eigenmann
ISVC
2009
Springer
15 years 10 months ago
Parallel 3D Image Segmentation of Large Data Sets on a GPU Cluster
In this paper, we propose an inherent parallel scheme for 3D image segmentation of large volume data on a GPU cluster. This method originates from an extended Lattice Boltzmann Mod...
Aaron Hagan, Ye Zhao
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
15 years 10 months ago
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
Bin Cui, Hua Lu, Quanqing Xu, Lijiang Chen, Yafei ...
ICS
2005
Tsinghua U.
15 years 9 months ago
Parallel sparse LU factorization on second-class message passing platforms
Several message passing-based parallel solvers have been developed for general (non-symmetric) sparse LU factorization with partial pivoting. Due to the fine-grain synchronizatio...
Kai Shen
MICRO
2002
IEEE
159views Hardware» more  MICRO 2002»
15 years 8 months ago
Master/slave speculative parallelization
Master/Slave Speculative Parallelization (MSSP) is an execution paradigm for improving the execution rate of sequential programs by parallelizing them speculatively for execution ...
Craig B. Zilles, Gurindar S. Sohi