SIAMCOMP
2012
11 years 7 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
SIAMCOMP
2012
11 years 7 months ago
2012
SIAMCOMP
2012
11 years 7 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
SIAMCOMP
2012
11 years 7 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
SIAMCOMP
2012
11 years 7 months ago
2012
d Abstract) Sanjeev Arora∗ L´aszl´o Lov´asz† Ilan Newman‡ Yuval Rabani§ Yuri Rabinovich¶ Santosh Vempala Motivated by applications in combinatorial optimization, we ini...