We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
Kamalika Chaudhuri, Sham M. Kakade, Karen Livescu,...
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...