12 search results - page 3 / 3 » When Does a Curve Bound a Distorted Disk |
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...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...