Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
The fundamental goal of computational neuroscience is to discover anatomical features that reflect the functional organization of the brain. Investigations of the physical connect...
Cui Lin, Shiyong Lu, Danqing Wu, Jing Hua, Otto Mu...
Abstract. Motion segmentation involves identifying regions of the image that correspond to independently moving objects. The number of independently moving objects, and type of mot...
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...