In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...