THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
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...