In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
This paper introduces and solves a security problem of pervasive computing: how to define authorizations for offline interactions when trust relationships among entities do not ex...
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...