176 search results - page 7 / 36 » Sorting and Selection with Random Costs |
IEEEPACT
2007
IEEE
14 years 2 months ago
2007
IEEE
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
PVLDB
2008
13 years 7 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
SIAMCOMP
2002
13 years 7 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...