Given a collection H of n lines in the plane, the level of a point x is the number of lines of H lying below x or passing thru x. We show that for a given k, one can compute the convex hull of the set of points of level k, in time O(n log 4 n). This implies that a description of the set of centerpoints of a given n-point set in the plane can be found within the same time bound, and a point of g...

Typically, one approaches a supervised machine learning problem by writing down an objective function and nding a hypothesis that minimizes it. This is equivalent to nding the Maximum A Posteriori (MAP) hypothesis for a Boltzmann distribution. However, MAP is not a robust statistic. We present an alternative approach by de ning a median of the distribution, which we show is both more robust, an...

Modern RISC processors provide a special instruction { the fused multiplyadd (FMA) instruction a b c { to perform both a multiplication and an addition operation at the same time. In this paper newly developed radix-2, radix-4, and split-radix FFT algorithms that optimally take advantage of this powerful instruction are presented. All oating-point operations of these algorithms are executed as ...

We study a statistical data depth with respect to compact convex random sets, which is consistent the multivariate Tukey and for fuzzy sets. In addition, it provides different perspective existing halfspace studying this function, we provide series of properties These are an adaptation that constitute axiomatic notions multivariate, functional, depth-functions other well-known depth.

In a cognitive radio network, a primary user (PU) shares its spectrum with secondary users (SUs) temporally and spatially, while allowing for some interference. Consider the problem of estimating the no-talk region of the PU, i.e., the region outside which SUs may utilize the PU’s spectrum regardless of whether the PU is transmitting or not. And propose a adaptive boundary estimation algorithm ...

Irregular applications are characterized by highly irregular and ne-grained data referencing patterns. When there is poor locality between the ne-grained data, serious false sharing can occur which has largely contributed to poor performance of irregular applications on page-based software distributed shared memory (DSM) systems. Partitioning data in irregular applications to improve data local...