12 search results - page 3 / 3 » Lower bounds on individual sequence regret |
SIAMCOMP
2000
13 years 5 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...