Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Partially occluded faces are common in many applications
of face recognition. While algorithms based on sparse
representation have demonstrated promising results, they
achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...