We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
In many settings, agents need to identify competent partners to assist them in accomplishing tasks. Direct experience may not provide sufficient data to learn the competence of ot...
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
Measuring the bottleneck link bandwidth along a path is important for understanding the performance of many Internet applications. Existing tools to measure bottleneck bandwidth a...
A model for evaluating the effectiveness of automatic recording of television programs by digital personal video recorders (PVRs) is presented. The model is used to evaluate the t...