Sciweavers

2609 search results - page 163 / 522
» Optimizing for parallelism and data locality
Sort
View
CLUSTER
2011
IEEE
14 years 19 days ago
A Framework for Data-Intensive Computing with Cloud Bursting
—For many organizations, one attractive use of cloud resources can be through what is referred to as cloud bursting or the hybrid cloud. These refer to scenarios where an organiz...
Tekin Bicer, David Chiu, Gagan Agrawal
ICDM
2010
IEEE
264views Data Mining» more  ICDM 2010»
14 years 10 months ago
Block-GP: Scalable Gaussian Process Regression for Multimodal Data
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
Kamalika Das, Ashok N. Srivastava
STACS
2009
Springer
15 years 7 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
PVM
2004
Springer
15 years 6 months ago
Numerical Simulations on PC Graphics Hardware
On recent PC graphics cards, fully programmable parallel geometry and pixel units are available providing powerful instruction sets to perform arithmetic and logical operations. In...
Jens Krüger, Thomas Schiwietz, Peter Kipfer, ...
106
Voted
ICS
2005
Tsinghua U.
15 years 6 months ago
Lightweight reference affinity analysis
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
Xipeng Shen, Yaoqing Gao, Chen Ding, Roch Archamba...