43 search results - page 2 / 9 » Calculating lower bounds for caching problems |
CCCG
2007
13 years 6 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
STOC
2006
ACM
13 years 11 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
MOBIHOC
2001
ACM
14 years 4 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...