2609 search results - page 163 / 522 » Optimizing for parallelism and data locality |
193
click to vote
CLUSTER
2011
IEEE
14 years 4 months ago
2011
IEEE
—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...
193
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
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...
121
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
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...
142
click to vote
PVM
2004
Springer
15 years 10 months ago
2004
Springer
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...
151
Voted
ICS
2005
Tsinghua U.
15 years 10 months ago
2005
Tsinghua U.
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...