The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
: The research work in this paper shows that the currently available stenographic methods might be quite easily detected by using sufficiently careful analysis of the transmitted d...
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
Symmetric key agreement is significant to security provisioning in sensor networks with resource limitations. A number of pairwise key pre-distribution protocols have been proposed...