We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
In vector quantization the number of vectors used to construct the codebook is always an undefined problem, there is always a compromise between the number of vectors and the quan...
We discuss the effect of a particular sequence acceleration method, the Lubkin W-transform, on the partial sums of Fourier series. We consider a very general class of functions wit...
A. Jason Boggess, B. Eric Bunch, C. Charles N. Moo...
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...