321 search results - page 6 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
120
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
105
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
133
click to vote
LSSC
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Air pollution models can efficiently be used in different environmental studies. The atmosphere is the most dynamic component of the environment, where the pollutants ca...
144
Voted
EUROPAR
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
135
Voted
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...