In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
Human activity analysis is an important problem in computer
vision with applications in surveillance and summarization
and indexing of consumer content. Complex human
activities...
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
To analyze the linear correlations of numeric attributes of government data, this paper proposes a method based on the clustering algorithm. A clustering method is adopted to prun...