The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memo...
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Mike Sul...
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
— Wireless video multicast enables delivery of popular events to many wireless users in a bandwidth efficient manner. However, providing good and stable video quality to a large...
Ozgu Alay, Thanasis Korakis, Yao Wang, Elza Erkip,...
In this paper, the performance of the Earth Mover’s Distance (EMD) vs χ2 distance as histogram similarity metrics for image retrieval is evaluated experimentally. Ground truth ...