90 search results - page 15 / 18 » A type theory for memory allocation and data layout |
TPDS
2002
13 years 7 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we propose a novel client-side, multi-granularity caching scheme, called "Complementary Space Caching" (CS caching), for location-based services in mobile ...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
DOCENG
2008
ACM
13 years 9 months ago
2008
ACM
"There will always (I hope) be print books, but just as the advent of photography changed the role of painting or film changed the role of theater in our culture, electronic ...