Several emerging large-scale Internet applications such as Content Distribution Networks, and Peerto-Peer networks could potentially benefit from knowing the underlying Internet t...
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or