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 Lanczos method is often used to solve a large and sparse symmetric matrix eigenvalue problem. There is a well-established convergence theory that produces bounds to predict the...
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room f...
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
We propose structural multidimensional multi-channel filter banks with desirable numbers of vanishing moments for the analysis and synthesis banks. For a two-channel filter bank, w...