253 search results - page 50 / 51 » High Level Programming Methodologies for Data Intensive Comp... |
CC
2006
Springer
13 years 11 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
22
Voted
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
CLUSTER
2009
IEEE
13 years 10 months ago
2009
IEEE
—The 64-bit OS provides ample memory address space that is beneficial for applications using a large amount of data. This paper proposes using a cluster as a memory resource for...
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...