Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
: New Algorithms for File System Cooperative Caching Eric Anderson, Christopher Hoover, Xiaozhou Li HP Laboratories HPL-2010-69 cooperative caching We present two new cooperative ...
Abstract - The Internet appears to playing a role in the restructuring of some traditional business sectors in which some organisations profit and some decline. Travel agencies are...
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
This paper describes our recent analysis on the security and privacy of biometric feature vectors obtained from fingerprint minutiae. A large number of contiguous regions (cuboid...