4155 search results - page 708 / 831 » External Memory Algorithms |
POPL
2007
ACM
14 years 10 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
EDBT
2006
ACM
14 years 10 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 ...
ICFP
2002
ACM
14 years 10 months ago
2002
ACM
Generational collection has improved the efficiency of garbage collection in fast-allocating programs by focusing on collecting young garbage, but has done little to reduce the co...
PLDI
2010
ACM
14 years 7 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...