Sciweavers

2303 search results - page 120 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
CW
2002
IEEE
15 years 8 months ago
Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
HIPC
2003
Springer
15 years 8 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
ATAL
2006
Springer
15 years 7 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
PDP
2010
IEEE
15 years 7 months ago
Efficient Distribution of Virtual Machines for Cloud Computing
The commercial success of Cloud computing and recent developments in Grid computing have brought platform virtualization technology into the field of high performance computing. Vi...
Matthias Schmidt, Niels Fallenbeck, Matthew Smith,...
107
Voted
IPPS
2007
IEEE
15 years 9 months ago
Integrated Risk Analysis for a Commercial Computing Service
Utility computing has been anticipated to be the next generation of computing usage. Users have the freedom to easily switch to any commercial computing service to complete jobs w...
Chee Shin Yeo, Rajkumar Buyya