We present a general technique for approximating various descriptors of the extent of a set P
of n points in R d when the dimension d is an arbitrary fixed constant. For a given extent …

We study the problem of computing a (1+ ε)-approximation to the minimum-volume
enclosing ellipsoid of a given point set\cal S={p^ 1, p^ 2,\dots, p^ n\} ⊆\mathbb R^ d. Based …

Given a set of points P⊂ Rd and value ε> 0, an ε-core-setS⊂ P has the property that the
smallest ball containing S has radius within 1+ ε of the radius of the smallest ball containing …

We prove the existence of small core-sets for solving approximate k-center clustering and
related problems. The size of these core-sets is considerably smaller than the previously …

We study the minimum enclosing ball (MEB) problem for sets of points or balls in high
dimensions. Using techniques of second-order cone programming and" core-sets", we have …

We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a
set of points in high dimensional Euclidean space. The resulting code is in most cases faster …

We present a new algorithm for domain adaptation improving upon a discrepancy
minimization algorithm,(DM), previously shown to outperform a number of algorithms for this …

We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-
dimensional space. Unlike previous methods, we explicitly address small cases (n= d+ 1) …

Abstract In the (1+ ε, r)-approximate near-neighbor problem for curves (ANNC) under some
similarity measure δ, the goal is to construct a data structure for a given set C of curves that …

Limited resources and harsh deployment environments may cause raw observations
collected by sensor nodes to have poor data quality and reliability, which will influence the …