Sciweavers

238 search results - page 37 / 48
» Optimistic parallelism benefits from data partitioning
Sort
View
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
EGPGV
2004
Springer
214views Visualization» more  EGPGV 2004»
14 years 29 days ago
Hierarchical Visualization and Compression of Large Volume Datasets Using GPU Clusters
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
Magnus Strengert, Marcelo Magallón, Daniel ...
HPDC
2002
IEEE
14 years 15 days ago
A Decentralized, Adaptive Replica Location Mechanism
We describe a decentralized, adaptive mechanism for replica location in wide-area distributed systems. Unlike traditional, hierarchical (e.g, DNS) and more recent (e.g., CAN, Chor...
Matei Ripeanu, Ian T. Foster
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
13 years 12 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
VLSID
2009
IEEE
177views VLSI» more  VLSID 2009»
14 years 8 months ago
Accelerating System-Level Design Tasks Using Commodity Graphics Hardware: A Case Study
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...
Unmesh D. Bordoloi, Samarjit Chakraborty