Sciweavers

250 search results - page 18 / 50
» A Framework for Access Methods for Versioned Data
Sort
View
CLUSTER
2002
IEEE
14 years 23 days ago
Noncontiguous I/O through PVFS
With the tremendous advances in processor and memory technology, I/O has risen to become the bottleneck in high-performance computing for many applications. The development of par...
Avery Ching, Alok N. Choudhary, Wei-keng Liao, Rob...
CDC
2009
IEEE
159views Control Systems» more  CDC 2009»
14 years 16 days ago
A distributed machine learning framework
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
Tansu Alpcan, Christian Bauckhage
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 5 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ICPP
1991
IEEE
13 years 11 months ago
Automatic Parallel Program Generation and Optimization from Data Decompositions
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C....
JSAC
2006
106views more  JSAC 2006»
13 years 7 months ago
Mathematical Decomposition Techniques for Distributed Cross-Layer Optimization of Data Networks
Abstract--Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful...
Björn Johansson, Pablo Soldati, Mikael Johans...